Skip to main content

Relay Boost Fusion for Learning Rare Concepts in Multimedia

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4071))

Abstract

This paper relates learning rare concepts for multimedia retrieval to a more general setting of imbalanced data. A Relay Boost (RL.Boost) algorithm is proposed to solve this imbalanced data problem by fusing multiple features extracted from the multimedia data. As a modified RankBoost algorithm, RL.Boost directly minimizes the ranking loss, rather than the classification error. RL.Boost also iteratively samples positive/negative pairs for a more balanced data set to get diverse weak ranking with different features, and combines them in a ranking ensemble. Experiments on the standard TRECVID 2005 benchmark data set show the effectiveness of the proposed algorithm.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. TRECVID: Trecvid home page, http://www-nlpir.nist.gov/projects/trecvid/

  2. Weiss, G.: Mining with rarity: A unifying framework. SIGKDD Explorations 6 (2004)

    Google Scholar 

  3. Cortes, C., Mohri, M.: Auc optimization vs. error rate minimization. In: Proc. of NIPS, vol. 16 (2003)

    Google Scholar 

  4. Natsev, A., Naphade, M.R., Tešió, J.: Learning the semantics of multimedia queries and concepts from a small number of examples. In: Proc. of the ACM SIGMM Int. Conf. on Multimedia (2005)

    Google Scholar 

  5. Chang, S.F., Hsu, W., Kennedy, L., Xie, L., Yanagawa, A., Zavesky, E., Zhang, D.Q.: Columbia university trecvid-2005 video search and high-level feature extraction (2005), http://www-nlpir.nist.gov/projects/tvpubs/tv.pubs.org.html

  6. Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research 4, 933–969 (2003)

    Article  MathSciNet  Google Scholar 

  7. Pazzani, M., Merz, C., Murphy, P., Ali, K., Hume, T., Brunk, C.: Reducing misclassification costs. In: Proc. of ICML, San Diego, CA, USA, pp. 217–225 (1994)

    Google Scholar 

  8. Chawla, N., Bowyer, K., Hall, L., Kegelmeyer, W.: Smote: Synthetic minority over-sampling technique. Journal of Artificial Intelligence Research 16, 321–357 (2004)

    Google Scholar 

  9. Yan, R., Liu, Y., Jin, R., Hauptmann, A.: On predicting rare classes with svm ensembles in scene classification. In: Proceedings of the IEEE ICASSP (2003)

    Google Scholar 

  10. Weiss, G.M., Provost, F.: Learning when training data are costly: the effect of class distribution on tree induction. Journal of Artificial Intelligence Research 19, 315–354 (2003)

    MATH  Google Scholar 

  11. Fan, W., Stolfo, S.J., Zhang, J., Chan, P.K.: Adacost: misclassification cost-sensitive boosting. In: Proceedings of the 16th ICML (1999)

    Google Scholar 

  12. Joshi, M.V., Kumar, V., Agarwal, R.C.: Evaluating boosting algorithms to classify rare cases: comparison and improvements. In: Proc. of First ICDM, pp. 257–264 (2001)

    Google Scholar 

  13. Chawla, N.V., Lazarevic, A., Hall, L.O., Bowyer, K.W.: SMOTEBoost: Improving prediction of the minority class in boosting. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS, vol. 2838, pp. 107–119. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Naphade, M.R., Smith, J.R.: On the detection of semantic concepts at trecvid. In: Proc. of the ACM SIGMM Int. Conf. on Multimedia (2004)

    Google Scholar 

  15. Snoek, C.G., Worring, M., Smeulders, A.W.: Early versus late fusion in semantic video analysis. In: Proc. of ACM Multimedia (2005)

    Google Scholar 

  16. Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines (2001), Software available at: http://www.csie.ntu.edu.tw/~cjlin/libsvm

  17. Naphade, M.R.: The ibm trecvid concept detection: Some new directions and results, http://www-nlpir.nist.gov/projects/tvpubs/tv.pubs.org.html

  18. von Neumann, J.: Various techniques used in connection with random digits. National Bureau of Standards, Applied Mathematics Series 12, 36–38 (1951)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, D., Li, J., Zhang, B. (2006). Relay Boost Fusion for Learning Rare Concepts in Multimedia. In: Sundaram, H., Naphade, M., Smith, J.R., Rui, Y. (eds) Image and Video Retrieval. CIVR 2006. Lecture Notes in Computer Science, vol 4071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11788034_28

Download citation

  • DOI: https://doi.org/10.1007/11788034_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-36018-6

  • Online ISBN: 978-3-540-36019-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics