Skip to main content

Sparse Representation for Machine Learning

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7884))

Included in the following conference series:

Abstract

Sparse representation is a parsimonious principle that a signal can be approximated by a sparse superposition of basis functions. The main topic of my thesis research is to apply this principle in the machine learning fields including classification, feature extraction, feature selection, and optimization.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The sparse representation toolbox in matlab, http://cs.uwindsor.ca/~li11112c/sr

  2. Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Review 51(1), 34–81 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Elad, M.: Sparse and Redundant Representations. Springer, New York (2010)

    Book  MATH  Google Scholar 

  4. Gao, S., Tsang, I.W.-H., Chia, L.-T.: Kernel sparse representation for image classification and face recognition. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part IV. LNCS, vol. 6314, pp. 1–14. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Jenatton, R., Mairal, J., Obozinski, G., Bach, F.: Proximal methods for hierarchical sparse coding. JMLR 12(2011), 2297–2334 (2011)

    MathSciNet  Google Scholar 

  6. Kim, S.J., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-point method for large-scale l1-regularized least squares. J-STSP 1(4), 606–617 (2007)

    Google Scholar 

  7. Li, Y., Ngom, A.: Non-negative matrix and tensor factorization based classification of clinical microarray gene expression data. In: BIBM, pp. 438–443. IEEE Press, Piscataway (2010)

    Google Scholar 

  8. Li, Y., Ngom, A.: Fast kernel sparse representation approaches for classification. In: ICDM, pp. 966–971. IEEE Press, Piscataway (2012)

    Google Scholar 

  9. Li, Y., Ngom, A.: Fast sparse representation approaches for the classification of high-dimensional biological data. In: BIBM, pp. 306–311. IEEE Press, Piscataway (2012)

    Google Scholar 

  10. Li, Y., Ngom, A.: Supervised dictionary learning via non-negative matrix factorization for classification. In: ICMLA, pp. 439–443. IEEE Press, Piscataway (2012)

    Google Scholar 

  11. Li, Y., Ngom, A.: Classification approach based on non-negative least squares. Neurocomputing (in press, 2013)

    Google Scholar 

  12. Li, Y., Ngom, A.: The non-negative matrix factorization toolbox for biological data mining. BMC Source Code for Biology and Medicine (2013), http://cs.uwindsor.ca/~li11112c/nmf (under revision)

  13. Li, Y., Ngom, A.: Sparse representation approaches for the classification of high-dimensional biological data. BMC Systems Biology (in press, 2013)

    Google Scholar 

  14. Tibshirani, R.: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological) 58(1), 267–288 (1996)

    MathSciNet  MATH  Google Scholar 

  15. Wright, J., Yang, A., Ganesh, A., Sastry, S.S., Ma, Y.: Robust face recognition via sparse representation. TPAMI 31(2), 210–227 (2009)

    Article  Google Scholar 

  16. Yin, J., Liu, X., Jin, Z., Yang, W.: Kernel sparse representation based classification. Neurocmputing 77, 120–128 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, Y. (2013). Sparse Representation for Machine Learning. In: Zaïane, O.R., Zilles, S. (eds) Advances in Artificial Intelligence. Canadian AI 2013. Lecture Notes in Computer Science(), vol 7884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38457-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38457-8_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38456-1

  • Online ISBN: 978-3-642-38457-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics