Abstract
Nonnegative matrix factorization (NMF) has received considerable attention in data representation due to its strong interpretability. However, traditional NMF methods neglect the discriminative information and geometric structure of both the data space and the feature space, simultaneously. In this paper, we propose a dual local learning regularized nonnegative matrix factorization (DLLNMF) method, which not only considers the geometric structure of both the data manifold and the feature manifold, simultaneously, but also takes advantage of the discriminative information of both the data space and the feature space. To make full use of the partial label information among samples, we further propose its semi-supervised extension, called dual local learning regularized nonnegative matrix factorization with label constraint (DLLNMF-LC), which imposes the label information as a hard constraint without additional parameters. Experimental results on some benchmark datasets have demonstrated the effectiveness of our proposed methods.
Similar content being viewed by others
References
Li Z, Jiang W, Meng H (2010) Fishervioce: a discriminant subspace framework for speaker recognition. In: IEEE International Conference on Acoustics Speech & Signal Processing (ICASSP), pp 4522–4525
Wen X, Shao L, Xue Y et al (2015) A rapid learning algorithm for vehicle classification. Inf Sci 295(1):395–406
Pan Z, Zhang Y, Wong K (2015) Efficient motion and disparity estimation optimization for low complexity multiview video coding. IEEE Trans Broadcast 61(2):166–176
Shu Z, Fan H et al (2017) Multiple Laplacian graph regularized low-rank representation with application to image representation. IET Image Proc 6:370–378
Chen Y, Zhou J, Cai D et al (2013) Nonnegative local coordinate factorization for image representation. IEEE Trans Image Process 22(3):969–976
Shu Z, Wu X et al (2019) The optimal graph regularized sparse coding with application to image representation. PRCV 2:91–101
Wang J, Tian F, Liu C et al (2015) Robust semi-supervised nonnegative matrix factorization. In: International Joint Conference on Neural Networks (IJCNN)
Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401:788–791
Jian S, Pang G, Cao L et al (2019) CURE: flexible categorical data representation by hierarchical coupling learning. IEEE Trans Knowl Data Eng 31(5):853–866
Li H, Zhang J, Hu J et al (2016) Graph-based discriminative concept factorization for data representation. Knowl Based Syst 118:70–79
Peng S, Ser W, Lin Z et al (2019) Dual graph regularized sparse nonnegative matrix factorization for data representation. In: IEEE (ISCAS)
Cai D, He X, Wu X et al (2008) Non-negative matrix factorization on manifold. In: International Conference on Data Mining (ICDM’08)
Tenenbaum JB, de Silva V, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319–2323
Roweis ST, Saul LK (2000) Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323–2326
Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6):1373–1396
Yang J, Zhang D, Frangi A et al (2004) Two-dimensional PCA: a new approach to appearance-based face representation and recognition. IEEE Trans Pattern Anal Mach Intell 26(1):131–137
Zhang H, Wu Q, Chow T et al (2012) A two-dimensional neighborhood preserving projection for appearance-based face recognition. Pattern Recognit 45(5):1866–1876
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
Liu H, Wu Z, Cai D et al (2011) Constrained non-negative matrix factorization for image representation. IEEE Trans Softw Eng 217:0162–8828
Gu Q, Zhou J (2009) Local learning regularized nonnegative matrix factorization. In: The Twenty-first international joint conference on artificial intelligence, pp 1044–1051
Ye J, Jin Z (2014) Dual-graph regularized concept factorization for clustering. Neurocomputing 138:120–130
Gu Q, Zhou J (2009) Co-clustering on manifolds. In: The 15th ACM SIGKDD international conference on Knowledge Discovery and Data Mining (KDD), pp 359–368
Shang F, Jiao LC, Wang F (2012) Graph dual regularization non-negative matrix factorization for co-clustering. Pattern Recognit 45:2237–2250
Scholkopf B, Smola AJ (2002) Learning with kernels. MIT Press, Cambridge
Trigeorgis G, Bousmalis K, Zafeiriou S et al (2015) A deep matrix factorization method for learning attribute representations. IEEE Trans Pattern Anal Mach Intell 39(3):417–429
Acknowledgements
This work was supported by the National Natural Science Foundation of China [Grant Nos. 61603159, 61902160], Natural Science Foundation of Jiangsu Province [Grant No. BK20160293], Natural Science Foundation of Universities in Jiangsu Province (Nos. 19KJD510003, 19KJB520006), Excellent Key Teachers of QingLan Project in Jiangsu Province, Graduate Student Practice Innovation Foundation of Jiangsu Province [Grant No. SJCX20_1049].
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Shu, Z., Zhang, Y., Li, P. et al. Dual local learning regularized nonnegative matrix factorization and its semi-supervised extension for clustering. Neural Comput & Applic 33, 6213–6231 (2021). https://doi.org/10.1007/s00521-020-05392-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-020-05392-7