Skip to main content

Classification and Clustering via Structure-enforced Matrix Factorization

  • Conference paper
  • First Online:
Intelligence Science and Big Data Engineering (IScIDE 2017)

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

Abstract

In this paper, we present a new classification and clustering framework via structure-enforced matrix factorization which represents a large class of mathematical models appearing in many applications. We are factorizing the data as representations of several blocks, one block for each cluster or class. The signals which are best reconstructed by the same block are clustered together. The proposed framework additionally imposes incoherence in the blocks since an incoherence promoting term encourages blocks associated to different classes to be as independent as possible. In addition, the new framework is applicable both to supervised and unsupervised learning. We first illustrate the proposed framework for the MNIST digit dataset in the supervised and unsupervised way, respectively, obtaining results comparable to the state-of-the-art. We then present experiments for fully unsupervised clustering on simple texture images for instance, also yielding excellent performance.

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

References

  1. Ramirez, I., Sprechmann, P., Sapiro, G.: Classification and clustering via dictionary learning with structured incoherence and shared features. In: 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, San Francisco, CA, pp. 3501–3508 (2010)

    Google Scholar 

  2. Xu, L., Yu, B., Zhang, Y.: An alternating direction and projection algorithm for structure-enforced matrix factorization. Comput. Optim. Appl. (2017). doi:10.1007/s10589-017-9913-x

  3. Lee, H., Battle, A., Raina, R., Ng, A.Y.: Efficient sparse coding algorithms. In: NIPS, vol. 19 (2007)

    Google Scholar 

  4. Mairal, J., Bach, F., Ponce, J., Sapiro, G., Zisserman, A.: Discriminative learned dictionaries for local image analysis. In: CVPR (2008)

    Google Scholar 

  5. Peyré, G.: Sparse modeling of textures. J. Math. Imaging Vis. 34, 17–31 (2009)

    Article  MathSciNet  Google Scholar 

  6. Yang, J., Yu, K., Gong, Y., Huang, T.: Linear spatial pyramid matching using sparse coding for image classification. In: CVPR (2009)

    Google Scholar 

  7. Yuan, J., Wang, D., Cheriyadat, A.M.: Factorization-based texture segmentation. IEEE Trans. Image Process. 24(11), 3488–3497 (2015)

    Article  MathSciNet  Google Scholar 

  8. Zdunek, R., Phan, A.H., Cichocki, A.: Image classification with nonnegative matrix factorization based on spectral projected gradient. In: Koprinkova-Hristova, P., Mladenov, V., Kasabov, N.K. (eds.) Artificial Neural Networks: Methods and Applications in Bio-/Neuroinformatics. SSB, vol. 4, pp. 31–50. Springer, Cham (2015). doi:10.1007/978-3-319-09903-3_2

    Google Scholar 

  9. Bampis, C.G., Maragos, P., Bovik, A.C.: Projective non-negative matrix factorization for unsupervised graph clustering. In: 2016 IEEE International Conference on Image Processing (ICIP), Phoenix, AZ, pp. 1255–1258 (2016)

    Google Scholar 

  10. Wang, Y., Wu, S., Mao, B., Zhang, X., Luo, Z.: Correntropy induced metric based graph regularized non-negative matrix factorization. Neurocomputing 204, 172–182 (2016)

    Article  Google Scholar 

  11. Sprechmann, P., Sapiro, G.: Dictionary learning and sparse coding for unsupervised clustering. In: Proceedings of ICASSP (2010)

    Google Scholar 

  12. Glowinski, R., Marroco, A.: Sur lapproximation, par elements finis dordre un, et la resolution, par penalisation-dualite dune classe de problemes de dirichlet non lineaires. Revue francaise dautomatique, informatique, recherche operationnelle. Analyse numerique 9(2), 41–76 (1975)

    Article  MATH  Google Scholar 

  13. Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17–40 (1976)

    Article  MATH  Google Scholar 

  14. Mairal, J., Bach, F., Ponce, J., Sapiro, G., Zisserman, A.: Supervised dictionary learning. In: NIPS, vol. 21, pp. 1033–1040 (2009)

    Google Scholar 

  15. Randen, T., Husøy, J.H.: Filtering for texture classification: a comparative study. IEEE Trans. Pattern Anal. Mach. Intell. 21(4), 291–310 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lijun Xu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Xu, L., Zhou, Y., Yu, B. (2017). Classification and Clustering via Structure-enforced Matrix Factorization. In: Sun, Y., Lu, H., Zhang, L., Yang, J., Huang, H. (eds) Intelligence Science and Big Data Engineering. IScIDE 2017. Lecture Notes in Computer Science(), vol 10559. Springer, Cham. https://doi.org/10.1007/978-3-319-67777-4_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67777-4_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67776-7

  • Online ISBN: 978-3-319-67777-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics