Skip to main content
SpringerLink
Log in

Adaptive graph regularized nonnegative matrix factorization for data representation

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

As a classical data representation method, nonnegative matrix factorization (NMF) can well capture the global structure information of the observed data, and it has been successfully applied in many fields. It is generally known that the local manifold structures will have a better effect than the global structures in image recognition and clustering. The local structure information can well be preserved by the neighbor graph in the manifold learning methods. The traditional neighbor graph constructed relies heavily on the original observed data. However, the original data usually contain a lot of noise and outliers in practical application, which results in obtaining inaccurate neighbor graph, and ultimately leads to performance degradation. How to get the ideal local structure information becomes more and more important. By combing the manifold learning into NMF, we propose an adaptive graph regularized nonnegative matrix factorization (AGNMF). In AGNMF, the neighbor graph is obtained by adaptive iteration. Both the global information and the local manifold can be well captured in AGNMF, and the better data representation can be obtained. A large number of experiments on different data sets show that our AGNMF has good clustering ability.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Luo T, Hou C, Nie F, Yi D (2019) Dimension reduction for non-Gaussian data by adaptive discriminative analysis. IEEE Transactions on Cybernetics 49(3):933–946

    Article  Google Scholar 

  2. Liu Z, Wang X, Pu J, Wang L, Zhang L (2017) Nonnegative low-rank representation based manifold embedding for semi-supervised learning. Knowl-Based Syst 136:121–129

    Article  Google Scholar 

  3. Kim K (2018) An improved semi-supervised dimensionality reduction using feature weighting: application to sentiment analysis. Expert Syst Appl 109:49–65

    Article  Google Scholar 

  4. Zhang P, Gao W, Liu G (2018) Feature selection considering weighted relevancy. Appl Intell 48(12):4615–4652

    Article  Google Scholar 

  5. Liu Z, Pu J, Huang T (2013) A novel classification method for palmprint recognition based on reconstruction error and normalized. Appl Intell 39:307–314

    Article  Google Scholar 

  6. Zheng K, Wang X (2018) Feature selection method with joint maximal information entropy between features and class. Pattern Recogn 77:20–29

    Article  Google Scholar 

  7. Paiva JS, Cardoso J, Pereira T (2018) Supervised learning methods for pathological arterial pulse wave differentiation: a SVM and neural networks approach. Int J Med Inform 109:30–38

    Article  Google Scholar 

  8. Wang D, Chen J (2018) Supervised speech separation based on deep learning: an overview. IEEE/ACM Transactions on Audio Speech & Language Processing 26(10):1702–1726

    Article  Google Scholar 

  9. Zhang A, Gao X (2018) Supervised data-dependent kernel sparsity preserving projection for image recognition. Appl Intell 48(12):4923–4936

    Article  Google Scholar 

  10. Xin X, Wang J, Xie R, Zhou S, Huang W, Zheng N (2019) Semi-supervised person re-identification using multi-view clustering. Pattern Recogn 88:285–297

    Article  Google Scholar 

  11. Ma J, Wen Y, Yang L (2019) Lagrangian supervised and semi-supervised extreme learning machine. Appl Intell 49(2):303–318

    Article  Google Scholar 

  12. Lee D, Lee S, Kim M (2018) Historical inference based on semi-supervised learning. Expert Syst Appl 106:121–131

    Article  Google Scholar 

  13. Lopez-Rubio E, Palomo EJ, Ortega-Zamorano F (2018) Unsupervised learning by cluster quality optimization. Inf Sci 436:31-55 (

  14. Xiang L, Zhao G, Li Q, Hao W, Li F (2018) TUMK-ELM: a fast unsupervised heterogeneous data learning approach. IEEE Access 6:35305–35315

    Article  Google Scholar 

  15. Cao W, Qian S, Wu S (2019) Unsupervised multi-task learning with hierarchical data structure. Pattern Recogn 86:248–264

    Article  Google Scholar 

  16. Lee DD, Seung HS (1999) Learning the parts of objects by nonnegative matrix factorization. Nature 401:788–791

    Article  Google Scholar 

  17. Chen Z, Li L, Peng H, Liu Y, Yang Y (2018) Incremental general non-negative matrix factorization without dimension matching constraints. Neurocomputing 311:344–352

    Article  Google Scholar 

  18. Zong L, Zhang X, Zhao L, Yu H, Zhao Q (2017) Multi-view clustering via multi-manifold regularized nonnegative matrix factorization. Neural Networks Official J International Neural Network Society 88:74–89

    Article  Google Scholar 

  19. Cui G, Li X, Dong Y (2018) Subspace clustering guided convex nonnegative matrix factorization. Neurocomputing 292:38–48

    Article  Google Scholar 

  20. Kholod I, Kuprianov M, Llya P (2018) Parallel and distributed data mining in cloud. In: Advances in data mining. Applications and theoretical aspects. Springer International Publishing, pp 349–362

  21. Jaeniche S, Franzini G, Cheema MF et al (2016) Visual text analysis in digital humanities. Computer Graphics Forum 36(6):226–250

    Article  Google Scholar 

  22. Cerina L, Cancian P, Franco G et al (2017) A hardware acceleration for surface EMG non-negative matrix factorization. IEEE International Parallel and Distributed Processing Symposium: Workshops IEEE Computer Society:168–174

  23. Wang Y, Jia Y, Hu C et al (2014) Fisher non-negative matrix factorization for learning local features. In: Asian conference on computer vision, 27–30

    Google Scholar 

  24. Mohammadreza B, Stefanos T, Maryam B et al (2016) Discriminative nonnegative matrix factorization for dimensionality reduction. Neurocomputing. 173(2):212–223

    Google Scholar 

  25. Liu H, Wu Z (2010) Non-negative matrix factorization with constraints. In: Twenty-fourth AAAI conference on artificial intelligence, pp 506–511

    Google Scholar 

  26. Naiyang Guan, Dacheng Tao, Zhigang Luo, et al. Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent. IEEE Transactions on Image Processing, 20(7):2030–2048.1 (2011)

  27. Hoyer P (2004) Non-negative matrix factorization with sparseness constraints. J Machine Learning Research 5:1457–1469

    MathSciNet  MATH  Google Scholar 

  28. Lu H, Fu Z, Shu X (2014) Non-negative and sparse spectral clustering. Pattern Recogn 47(1):418–426

    Article  Google Scholar 

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

    Article  Google Scholar 

  30. Cai D, He X, Han J et al (2011) Graph regularized non-negative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548–1560

    Article  Google Scholar 

  31. Wei L, Chang S (2009) Robust multi-class transductive learning with graphs. In: Proceedings of the 19th IEEE conference on computer vision and pattern recognition, pp 381–388

    Google Scholar 

  32. Wang J, Wang F, Zhang C et al (2009) Linear neighborhood propagation and its applications. IEEE Trans Pattern Anal Mach Intell 31(9):1600–1615

    Article  Google Scholar 

  33. Yang J, Zhang D, Yang J, Niu B (2007) Globally maximizing, locally minimizing: unsupervised discriminant projection with applications to face and palm biometrics. IEEE Trans Pattern Anal Mach Intell 29(4):650–664

    Article  Google Scholar 

  34. Lu X, Wang Y, Yuan Y (2013) Graph-regularized low-rank representation for destriping of hyperspectral images. IEEE Trans Geosci Remote Sens 51(7):4009–4018

    Article  Google Scholar 

  35. Nie F, Zhu W, Li X (2016) Unsupervised feature selection with structured graph optimization. In: Thirtieth AAAI conference on artificial intelligence, 1302–1308

    Google Scholar 

  36. Mohar B, Alavi Y, Chartrand G et al (1991) The laplacian spectrum of graphs. In: Graph theory, combinatorics, and applications, vol 2, pp 871–898

    Google Scholar 

  37. Fan K (1949) On a theorem of weyl concerning eigenvalues of linear transformations i. Proc Natl Acad Sci U S A 35(11):652–655

    Article  MathSciNet  Google Scholar 

  38. Wang X, Bai Y (2016) The global Minmax k-means algorithm. Springerplus 5(1):1665

    Article  Google Scholar 

  39. Turk M, Pentland A (1991) Facere cognition using Eigenfaces. In: IEEE computer society conference on computer vision and pattern recognition, pp 586–591

    Google Scholar 

  40. Peng C, Kang Z, Hu Y, Cheng J, Cheng Q (2017) Robust graph regularized nonnegative matrix factorization for clustering. ACM Trans Knowl Discov Data 11(3):1–30

    Article  Google Scholar 

  41. Zhu W, Yan Y, Peng Y (2018) Topological structure regularized nonnegative matrix factorization for image clustering. Neural Comput & Applic. https://doi.org/10.1007/s00521-018-3572-4

Download references

Acknowledgments

This work was partly supported by NSFC of China (U1504610), Natural Science Foundations of Henan Province (192102210130, 19B520008), the Natural Science Foundation of Guangdong Province (2016A030307050), the Special Foundation of Public Research of Guangdong Province (2016A020225008, 2017A040405062).

Author information

Authors and Affiliations

  1. Information Engineering College, Henan University of Science and Technology, Luoyang, China

    Lin Zhang, Zhonghua Liu, Jiexin Pu & Bin Song

Authors
  1. Lin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhonghua Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiexin Pu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bin Song
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhonghua Liu.

Ethics declarations

Conflict of interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, L., Liu, Z., Pu, J. et al. Adaptive graph regularized nonnegative matrix factorization for data representation. Appl Intell 50, 438–447 (2020). https://doi.org/10.1007/s10489-019-01539-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-019-01539-9

Keywords

Search

Navigation