Skip to main content
SpringerLink
Log in

Non-negative matrix factorization via adaptive sparse graph regularization

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Non-negative matrix factorization (NMF), as an efficient and intuitive dimension reduction algorithm, has been successfully applied to clustering tasks. However, there are still two dominating limitations. First, the original NMF only pays attention to the global data structure, ignoring the intrinsic geometry of the original higher-dimensional data. Second, the traditional pairwise distance-based graph construction is sensitive to noise and outliers, and the nearest neighbor graph obtained is not optimal. As a result, the clustering performance will be reduced. To solve the aforementioned problems and increase the cluster accuracy, a non-negative matrix factorization via adaptive sparse graph (NMF_ASGR) is proposed in this paper. More precisely, this paper assembles the sparse representation and manifold learning into a framework to get the l1 sparse robust graph. The l1 sparse robust graph not only can adaptively discover the potential manifold structure of the data, but also has strong robustness to noise and outliers, which makes the structure of the graph can be learned automatically in the process of matrix decomposition. Moreover, an adaptive sparse graph is learned to batter regularize the NMF. Finally, the effectiveness and superiority of the proposed algorithm are illustrated by lots of image clustering experiments.

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

Similar content being viewed by others

References

  1. Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer

  2. Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773–4795

    Article  Google Scholar 

  3. Azzopardi G, Petkov N (2013) Trainable COSFIRE filters for Keypoint detection and pattern recognition. IEEE Trans Pattern Anal Mach Intell 35(2):490–503

    Article  Google Scholar 

  4. Bampis CG, Maragos P, Bovik AC (2016) Projective non-negative matrix factorization for unsupervised graph clustering. IEEE International Conference on Image Processing (ICIP):1255–1258. https://doi.org/10.1109/ICIP.2016.7532559

  5. Barik D, Mondal M (2010) Object identification for computer vision using image segmentation. In: International Conference on Education Technology and Computer, pp V2-170–V2-172, https://doi.org/10.1109/ICETC.2010.5529412.

  6. Bernstein A, Kuleshov A, Yanovich Y (2015) Statistical learning via manifold learning. In: International Conference on Machine Learning and Applications (ICMLA), pp 64–69, https://doi.org/10.1109/ICMLA.2015.26.

  7. Cai D, He X, Wang X (2009) Locality preserving nonnegative matrix factorization. In: International Joint Conference on Artificial Intelligence, pp. 1010–1015.

  8. Cai D, He X, Han J, Huang TS (2010) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548–1560

    Google Scholar 

  9. Cai J-F, Candés EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956–1982

    Article  MathSciNet  MATH  Google Scholar 

  10. Cheng B, Yang J, Yan S et al (2010) Learning with -graph for image analysis. IEEE Trans Image Process 19(4):858–866

    Article  MathSciNet  MATH  Google Scholar 

  11. Chin T, Suter D (2007) Incremental Kernel principal component analysis. IEEE Trans Image Process 16(6):1662–1674

    Article  MathSciNet  Google Scholar 

  12. Chu WW, Johnson DB, Kangarloo H (2000) A medical digital library to support scenario and user-tailored information retrieval. IEEE Trans Inf Technol Biomed 4(2):97–107

    Article  Google Scholar 

  13. Cui H, Liu Q, Zhang J, Kang B (2019) An improved Deng entropy and its application in pattern recognition. IEEE Access 7:18284–18292. https://doi.org/10.1109/ACCESS.2019.2896286

    Article  Google Scholar 

  14. Dandil E, Çevik KK (2019) Computer vision based distance measurement system using stereo camera view. In : International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT), pp 1–4, https://doi.org/10.1109/ISMSIT.2019.8932817.

  15. Ding C, Kong D (2012) Nonnegative matrix factorization using a robust error function. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp 2033-2036.

  16. Du H, Zhang X, Hu Q et al (2015) Sparse representation-based robust face recognition by graph regularized low-rank sparse representation recovery. Neurocomputing 164:220–229. https://doi.org/10.1016/j.neucom.2015.02.067

    Article  Google Scholar 

  17. Elhamifar E, Vidal R (2009) Sparse subspace clustering. IEEE Conference on Computer Vision and Pattern Recognition, In, pp 2790–2797. https://doi.org/10.1109/CVPR.2009.5206547

    Book  Google Scholar 

  18. He R, Zheng WS, Hu BG (2011) Nonnegative sparse coding for discriminative semi-supervised learning. IEEE Conference on Computer Vision & Pattern Recognition, In, pp 2849–2856

    Google Scholar 

  19. He X, Wang Q, Li X (2019) Robust adaptive graph regularized non-negative matrix factorization. IEEE Access 7:83101–83110. https://doi.org/10.1109/ACCESS.2019.2924520

    Article  Google Scholar 

  20. Howland P, Park H (2004) Generalizing discriminant analysis using the generalized singular value decomposition. IEEE Trans Pattern Anal Mach Intell 26(8):995–1006

    Article  Google Scholar 

  21. Huang D, Mi J (2007) A new constrained independent component analysis method. IEEE Trans Neural Netw 18(5):1532–1535

    Article  Google Scholar 

  22. Kong D, Ding C, Huang H (2011) Robust nonnegative matrix factorization using L21-norm. International Conference on Information and Knowledge Management, Proceedings, In, pp 673–682. https://doi.org/10.1145/2063576.2063676

    Book  Google Scholar 

  23. Lee DD, Seung HS (2001) Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems, pp:556–562

  24. Li L, Zhang Y (2008) Survey of nonnegative matrix factorization algorithms. Acta Electron Sin 36(4):737–743

  25. Li Z, Tang J, He X (2018) Robust structured nonnegative matrix factorization for image representation. IEEE Transactions on Neural Networks and Learning Systems 29(5):1947–1960

    Article  MathSciNet  Google Scholar 

  26. Lin Z, Chen M, Ma Y (2010) The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv preprint arXiv:1009.5055. https://doi.org/10.1016/j.jsb.2012.10.010

  27. Lin Z, Liu R, Su Z (2011) Linearized alternating direction method with adaptive penalty for low-rank representation. Advances in neural information processing systems, pp 612-620.

  28. Liu G, Lin Z, Yu Y (2010) Robust subspace segmentation by low-rank representation. EEE Transactions on Cybernetics 44(8):1432–1445

    Google Scholar 

  29. Liu Z, Ou W, Lu W, Wang L (2019) Discriminative feature extraction based on sparse and low-rank representation. Neurocomputing 362:129–138

    Article  Google Scholar 

  30. Liu Z, Shi K, Zhang K, Ou W, Wang L (2020) Discriminative sparse embedding based on adaptive graph for dimension reduction. Eng Appl Artif Intell 94:103758

    Article  Google Scholar 

  31. Pedreira CE (2006) Learning vector quantization with training data selection. IEEE Trans Pattern Anal Mach Intell 28(1):157–162

    Article  Google Scholar 

  32. Peng C, Kang Z, Hu Y et al (2017) Robust graph regularized nonnegative matrix factorization for clustering. ACM Transactions on Knowledge Discovery from Data (TKDD) 11(3):33.1

    Article  Google Scholar 

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

    Article  Google Scholar 

  34. Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326

    Article  Google Scholar 

  35. Wang Y, Zhang Y (2013) Nonnegative matrix factorization: a comprehensive review. IEEE Transactions on Knowledge & Data Engineering 25(6):1336–1353

    Article  MathSciNet  Google Scholar 

  36. Wang L, Guan N, Shi D, Fan Z, Su L (2019) Robust semi-supervised non-negative matrix factorization with structured normalization. IEEE Access 7:133996–134013. https://doi.org/10.1109/ACCESS.2019.2941219

    Article  Google Scholar 

  37. Yan S, Wang H (2009) Semi-supervised learning by sparse representation. SIAM International Conference on Data Mining, In, pp 792–801. https://doi.org/10.1137/1.9781611972795.68

    Book  Google Scholar 

  38. Yang Y, Wang Z, Yang J, et al. (2014) Data clustering by laplacian regularized l1-graph. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, pp 3148–3149.

  39. Yi Y, Wang J, Zhou W, Zheng C, Kong J, Qiao S (2020) Non-negative matrix factorization with locality constrained adaptive graph. IEEE Transactions on Circuits and Systems for Video Technology 30(2):427–441

    Article  Google Scholar 

  40. Zhang H, Zha ZJ, Yan S, Wang M, Chua T (2012) Robust non-negative graph embedding: towards noisy data, unreliable graphs, and noisy labels. IEEE Conference on Computer Vision and Pattern Recognition, In, pp 2464–2471. https://doi.org/10.1109/CVPR.2012.6247961

    Book  Google Scholar 

  41. Zhang H, Zha ZJ, Yang Y, Yan S, Chua T (2014) Robust (semi) nonnegative graph embedding. IEEE Trans Image Process 23(7):2996–3012

    Article  MathSciNet  MATH  Google Scholar 

  42. Zhang Y, Wang X, Wei H, Ge G (2019) On private information retrieval Array codes. IEEE Trans Inf Theory 65(9):5565–5573

    Article  MathSciNet  MATH  Google Scholar 

  43. Zhang L, Liu Z, Pu J, Song B (2020) Adaptive graph regularized nonnegative matrix factorization for data representation. Appl Intell 50(2):438–447

    Article  Google Scholar 

  44. Zheng M et al (2011) Graph regularized sparse coding for image representation. IEEE Trans Image Process 20(5):1327–1336

    Article  MathSciNet  MATH  Google Scholar 

  45. Zhong N, Yan T, Yang W and Xia G (2016) A supervised classification approach for PolSAR images based on covariance matrix sparse coding. In: International Conference on Signal Processing (ICSP), pp 213-216, https://doi.org/10.1109/ICSP.2016.7877826.

  46. Zhu W, Yan Y, Peng Y (2019) Topological structure regularized nonnegative matrix factorization for image clustering. Neural Comput & Applic 31(11):7381–7399

    Article  Google Scholar 

  47. Zhuang L, Gao S, Tang J, Wang J, Lin Z, Ma Y, Yu N (2015) Constructing a nonnegative low-rank and sparse graph with data-adaptive features. IEEE Trans Image Process 24(11):3717–3728

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant U1504610, and in party by the Key Science and Technology Program of Henan Province under Grant 182102210283.

Author information

Authors and Affiliations

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

    Guifang Zhang & Jiaxin Chen

Authors
  1. Guifang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiaxin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guifang Zhang.

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, G., Chen, J. Non-negative matrix factorization via adaptive sparse graph regularization. Multimed Tools Appl 80, 12507–12524 (2021). https://doi.org/10.1007/s11042-020-10247-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-10247-3

Keywords

Search

Navigation