Skip to main content

Incremental Shared Subspace Learning for Multi-label Classification

  • Conference paper
Computational Visual Media (CVM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7633))

Included in the following conference series:

Abstract

Multi-label classification plays an increasingly significant role in most applications, such as semantic scene classification. In order to exploit the related information hidden in different labels which is crucial for lots of applications, it is essential to extract a latent structure shared among different labels. This paper presents an incremental approach for extracting a shared subspace on dynamic dataset. With the incremental lossless matrix factorization, the proposed algorithm can be incrementally performed without using original existing input data so that to avoid high computational complexity and decreasing the predictive performance. Experimental results demonstrate that the proposed approach is much more efficient than the non-incremental methods.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 72.00
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hoerl, A., Kennard, R.: Ridge regression: Biased estimation for nonorthogonal problems. Technometrics 12(3), 55–67 (1970)

    Article  MATH  Google Scholar 

  2. Burges, C.J.C.: A Tutorial on Support Vector Machines for Pattern Recognition. Data Mining and Knowledge Discovery 2(2), 121–167 (1998)

    Article  Google Scholar 

  3. Golub, G.H., Van Loan, C.F.: Matrix Computations. The Johns Hopkins University Press (1996)

    Google Scholar 

  4. Tsoumakas, G., Katakis, I.: Multi-Label Classification: An Overview. International Journal of Data Warehousing and Mining 3(3), 1–13 (2007)

    Article  Google Scholar 

  5. Hotelling, H.: Relations between two sets of variates. Biometrika 28(3/4), 321–377 (1936)

    Article  MATH  Google Scholar 

  6. Ando, R.K., Zhang, T.: A framework for learning predictive structures from multiple tasks and unlabeled data. Journal of Machine Learning Research 6(2), 1817–1853 (2005)

    MathSciNet  MATH  Google Scholar 

  7. Ji, S., Tang, L., Yu, S., Ye, J.: Extracting shared subspace for multi-label classification. In: SIGKDD, pp. 381–389 (2008)

    Google Scholar 

  8. Barutcuoglu, Z., Schapire, R.E., Troyanskaya, O.G.: Hierarchical multi-label prediction of gene function. Bioinformatics 22(7), 830–836 (2006)

    Article  Google Scholar 

  9. Yang, Y., Pedersen, J.O.: A comparative study on feature selection in text categorization. In: ICML, pp. 412–420 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, L., Zhao, Y., Zhu, Z. (2012). Incremental Shared Subspace Learning for Multi-label Classification. In: Hu, SM., Martin, R.R. (eds) Computational Visual Media. CVM 2012. Lecture Notes in Computer Science, vol 7633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34263-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34263-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34262-2

  • Online ISBN: 978-3-642-34263-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics