Skip to main content

Clustering Friendly Dictionary Learning

  • Conference paper
  • First Online:
  • 2697 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13108))

Abstract

In this work we propose a dictionary learning based clustering approach. We regularize dictionary learning with a clustering loss; in particular, we have used sparse subspace clustering and K-means clustering. The basic idea is to use the coefficients from dictionary learning as inputs for clustering. Comparison with state-of-the-art deep learning based techniques shows that our proposed method improves upon them.

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   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Notes

  1. 1.

    https://en.wikipedia.org/wiki/Bartels%E2%80%93Stewart_algorithm.

  2. 2.

    https://www.cs.ubc.ca/~mpf/spgl1/index.html.

  3. 3.

    https://en.wikipedia.org/wiki/Segmentation-based_object_categorization#Computational_Complexity.

  4. 4.

    http://www2.ece.ohio-state.edu/~aleix/ARdatabase.html.

  5. 5.

    https://www.cs.columbia.edu/CAVE/software/softlib/coil-20.php.

  6. 6.

    http://vision.ucsd.edu/~leekc/ExtYaleDatabase/ExtYaleB.html.

References

  1. Ramirez, I., Sprechmann, P., Sapiro, G.: Classification and clustering via dictionary learning with structured incoherence and shared features. In: IEEE CVPR, pp. 3501–3508 (2010)

    Google Scholar 

  2. Sprechmann, P., Sapiro, G.: Dictionary learning and sparse coding for unsupervised clustering. In: IEEE ICASSP, pp. 2042–2045 (2010)

    Google Scholar 

  3. Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: ACM SIGIR, pp. 267–273 (2003)

    Google Scholar 

  4. Ding, C., He, X., Simon, H.D.: On the equivalence of nonnegative matrix factorization and spectral clustering. In: SIAM SDM, pp. 606–610 (2005)

    Google Scholar 

  5. Li, T., Ding, C.: The relationships among various nonnegative matrix factorization methods for clustering. In: IEEE ICDM, pp. 362–371 (2006)

    Google Scholar 

  6. Tian, F., Gao, B., Cui, Q., Chen, E., Liu, T.Y.: Learning deep representations for graph clustering. In: AAAI, pp. 1293–1299 (2014)

    Google Scholar 

  7. Peng, X., Xiao, S., Feng, J., Yau, W.Y., Yi, Z.: Deep sub-space clustering with sparsity prior. In: IJCAI, pp. 1925–1931 (2016)

    Google Scholar 

  8. Xie, J., Girshick, R., Farhadi, A.: Unsupervised deep embedding for clustering analysis. In: ICML, pp. 478–487 (2016)

    Google Scholar 

  9. Yang, B., Fu, X., Sidiropoulos, N.D., Hong, M.: Towards k-means-friendly spaces: Simultaneous deep learning and clustering. In: ICML, pp. 3861–3870 (2017)

    Google Scholar 

  10. Fard, M.M., Thonet, T., Gaussier, E.: Deep k-means: Jointly clustering with k-means and learning representations. Pattern Recogn. Lett. 138, 185–192 (2020)

    Article  Google Scholar 

  11. Guo, X., Liu, X., Zhu, E., Yin, J.: Deep clustering with convolutional autoencoders. In: ICONIP, pp. 373–382 (2017)

    Google Scholar 

  12. Yang, X., Deng, C., Zheng, F., Yan, J., Liu, W.: Deep spectral clustering using dual autoencoder network. In: IEEE CVPR, pp. 4061–4070 (2019)

    Google Scholar 

  13. Trigeorgis, G., Bousmalis, K., Zafeiriou, S., Schuller, B.W.: A deep matrix factorization method for learning attribute representations. IEEE Trans. Pattern Anal. Mach. Intell. 39(3), 417–429 (2017)

    Article  Google Scholar 

  14. Ravishankar, S., Bresler, Y.: Learning sparsifying transforms. IEEE Trans. Signal Process. 61(5), 1072–1086 (2013)

    Article  MathSciNet  Google Scholar 

  15. Maggu, J., Majumdar, A., Chouzenoux, E.: Transformed Subspace Clustering. IEEE Trans. Knowl. Data Eng. 33, 1796–1801 (2020)

    Article  Google Scholar 

  16. Maggu, J., Majumdar, A., Chouzenoux, E., Chierchia, G.: Deeply transformed subspace clustering. Signal Process. 174, 107628 (2020)

    Article  Google Scholar 

  17.  Bauckhage, C.: K-means clustering is matrix factorization (2015). arXiv preprint arXiv:1512.07548,

  18. Elhamifar, E., Vidal, R.: Sparse Subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35(11), 2765–2781 (2013)

    Article  Google Scholar 

  19. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)

    Article  Google Scholar 

Download references

Acknowledgement

This work is supported by Infosys Center for Artificial Intelligence at IIIT Delhi.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Angshul Majumdar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Goel, A., Majumdar, A. (2021). Clustering Friendly Dictionary Learning. In: Mantoro, T., Lee, M., Ayu, M.A., Wong, K.W., Hidayanto, A.N. (eds) Neural Information Processing. ICONIP 2021. Lecture Notes in Computer Science(), vol 13108. Springer, Cham. https://doi.org/10.1007/978-3-030-92185-9_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92185-9_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92184-2

  • Online ISBN: 978-3-030-92185-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics