Skip to main content

A Novel Data Clustering Method Based on Smooth Non-negative Matrix Factorization

  • Conference paper
  • First Online:

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

Abstract

Non-negative matrix factorization (NMF) is a very popular dimensionality reduction method that has been widely used in computer vision and data clustering. However, NMF does not consider the intrinsic geometric information of a data set and also does not produce smooth and stable solutions. To resolve these problems, we propose a Graph regularized Lp Smooth Non-negative Matrix Factorization (GSNMF) method by incorporating graph regularization with Lp smooth constraint. The graph regularization can discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. The Lp smooth constraint can combine the merits of isotropic (L2-norm) and anisotropic (L1-norm) diffusion smoothing, and produce a smooth and more accurate solution to the optimization problem. Experimental results on some data sets demonstrate that the proposed method outperforms related state-of-the-art NMF methods.

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

Learn about institutional subscriptions

References

  1. Lu, G.F., Wang, Y., Zou, J.: Low-rank matrix factorization with adaptive graph regularizer. IEEE Trans. Image Process. 25(5), 2196–2205 (2016)

    Article  MathSciNet  Google Scholar 

  2. Shang, F.H., Jiao, L.C., Wang, F.: Graph dual regularization non-negative matrix factorization for co-clustering. Pattern Recognit. 45(6), 2237–2250 (2012)

    Article  Google Scholar 

  3. Wang, D., Gao, X.B., Wang, X.M.: Semi-supervised nonnegative matrix factorization via constraint propagation. IEEE Trans. Cybern. 46(1), 233–244 (2016)

    Article  Google Scholar 

  4. He, W., Zhang, H.Y., Zhang, L.P.: Sparsity-regularized robust non-negative matrix factorization for hyperspectral unmixing. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 9(9), 4267–4279 (2016)

    Article  Google Scholar 

  5. Fan, F., Ma, Y., Li, C., Mei, X.G., Huang, J., Ma, J.Y.: Hyperspectral image denoising with superpixel segmentation and low-rank representation. Inf. Sci. 397, 48–68 (2017)

    Article  Google Scholar 

  6. Li, Z.C., Liu, J., Lu, H.Q.: Structure preserving non-negative matrix factorization for dimensionality reduction. Comput. Vis. Image Underst. 117(9), 1175–1189 (2013)

    Article  Google Scholar 

  7. Tenenbaum, J.B., Silva, V.D., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000)

    Article  Google Scholar 

  8. Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323–2326 (2000)

    Article  Google Scholar 

  9. Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in Neural Information Processing Systems, Vancouver, BC, Canada, vol. 14, pp. 585–591 (2001)

    Google Scholar 

  10. Cai, D., He, X. F., Han, J. W.: Isometric projection. In: Proceeding of the National Conference on Artificial Intelligence, Vancouver, BC, Canada, vol. 1, pp. 528–533 (2007)

    Google Scholar 

  11. Najafi, A., Joudaki, A., Fatemizadeh, E.: Nonlinear dimensionality reduction via path-based isometric mapping. IEEE Trans. Pattern Anal. Mach. Intell. 38(7), 1452–1464 (2016)

    Article  Google Scholar 

  12. Wang, Y.X., Zhang, Y.J.: Nonnegative matrix factorization: a comprehensive review. IEEE Trans. Knowl. Data Eng. 25(6), 1336–1353 (2013)

    Article  Google Scholar 

  13. Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788–791 (1999)

    Article  Google Scholar 

  14. Zeng, K., Yu, J., Li, C.H., You, J., Jin, T.S.: Image clustering by hyper-graph regularized non-negative matrix factorization. Neurocomputing 138, 209–217 (2014)

    Article  Google Scholar 

  15. Li, G.P., Zhang, X.Y., Zheng, S.Y., Li, D.Y.: Semi-supervised convex nonnegative matrix factorizations with graph regularized for image representation. Neurocomputing 237, 1–11 (2017)

    Article  Google Scholar 

  16. Leng, C.C., Cai, G.R., Yu, D.D., Wang, Z.Y.: Adaptive total-variation for non-negative matrix factorization on manifold. Pattern Recognit. Lett. 98, 68–74 (2017)

    Article  Google Scholar 

  17. Cai, D., He, X.F., Han, J.W., Huang, T.S.: Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1548–1560 (2011)

    Article  Google Scholar 

  18. Liu, H.F., Wu, Z.H., Li, X.L., Cai, D., Huang, T.S.: Constrained nonnegative matrix factorization for image representation. IEEE Trans. Pattern Anal. Mach. Intell. 34(7), 1299–1311 (2012)

    Article  Google Scholar 

  19. Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. Adv. Neural. Inf. Process. Syst. 13, 556–562 (2000)

    Google Scholar 

  20. Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence (1997)

    MATH  Google Scholar 

  21. Xu, W., Liu, X., Gong, Y.H.: Document clustering based on non-negative matrix factorization. In: Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2003), Toronto, Canada, pp. 267–273 (2003)

    Google Scholar 

  22. Cai, D., He, X.F., Han, J.W.: Document clustering using locality preserving indexing. IEEE Trans. Knowl. Data Eng. 17(12), 1624–1637 (2005)

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China under Grant Nos. 61702251, 61363049, 11571011, 61501286, the State Scholarship Fund of China Scholarship Council (CSC) under Grant No. 201708360040, the Natural Science Foundation of Jiangxi Province under Grant No. 20161BAB212033, the Natural Science Basic Research Plan in Shaanxi Province of China under Program No. 2018JM6030, the Key Research and Development Program in Shaanxi Province of China under Grant No. 2018GY-008, the Doctor Scientific Research Starting Foundation of Northwest University under Grant No. 338050050 and Youth Academic Talent Support Program of Northwest University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chengcai Leng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Leng, C., Zhang, H., Cai, G. (2018). A Novel Data Clustering Method Based on Smooth Non-negative Matrix Factorization. In: Basu, A., Berretti, S. (eds) Smart Multimedia. ICSM 2018. Lecture Notes in Computer Science(), vol 11010. Springer, Cham. https://doi.org/10.1007/978-3-030-04375-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04375-9_35

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics