Computer Science ›› 2017, Vol. 44 ›› Issue (6): 298-305.doi: 10.11896/j.issn.1002-137X.2017.06.053

Previous Articles     Next Articles

Graph Regularized and Incremental Nonnegative Matrix Factorization with Sparseness Constraints

SUN Jing, CAI Xi-biao, JIANG Xiao-yan and SUN Fu-ming   

  • Online:2018-11-13 Published:2018-11-13

Abstract: Nonnegative matrix factorization (NMF) not only is a description of the data,but also has intuitive physical meaning after the decomposition of the matrix.With the aim to enhance the validity and classification accuracy,a more reasonable algorithm was proposed,which is graph regularized and incremental nonnegative matrix factorization with sparseness constraints (GINMFSC).It not only preserves the intrinsic geometry of data,but also makes full use of the last step decomposition results as incremental learning,and introduces sparseness constraint to coefficient matrix.Finally,they are integrated into one single objective function and an efficient updating approach is produced.Compared with NMF,GNMF,INMF and IGNMF,experiments on several databases have shown that the proposed method achieves better clustering accuracy and sparsity while reducing the computation time.

Key words: Nonnegative matrix factorization,Graph regularized,Sparseness constraints,Incremental learning

[1] SHI W Y,GUO Y F,XUE X Y.A kernel principal component analysis algorithm for solving large scale data sets problem [J].Journal of Software,2009,8(20):2153-2159.(in Chinese) 史卫亚,郭跃飞,薛向阳.一种解决大规模数据集问题的核主成分分析算法[J].软件学报,2009,8(20):2153-2159.
[2] YIN H T,FU P,SHA X J.Face recognition based on DCT and linear discriminant analysis [J].Chinese Journal of Electronic,2009,0(37):2211-2214.(in Chinese) 尹洪涛,付平,沙学军.基于DCT和线性判别分析的人脸识别 [J].电子学报,2009,0(37):2211-2214.
[3] KOLDOVSKY Z,TICHAVSKY P,OJA E.Efficient variant of al-gorithm FastICA for independent component analysis attaining the Cramér-Rao lower bound[J].IEEE Trans Neural Networks,2006,7(5):1265-1277.
[4] WEI J J,CHANG C J,CHOU N K.ECG data compressionusing truncated singular value decomposition [J].IEEE Transa-ctions on Information Technology Biomed,2001,5(4):290-299.
[5] PAATERO P,TAPPER U.Positive Matrix Factorization:ANonnegative Factor Model with Optimal Utilization of Error Estimates of Data Values [J].Environmetrices,1994,5(2):111-126.
[6] LEE D D,SEUNG H S.Learning the parts of objects by non-negative matrix factorization [J].Nature,1999,1(6755):788-791.
[7] LEE D D,SEUNG H S.Algorithms for non-negative matrix factorization [J].Advances in Neural Information Processing Systems,2001,3:556-562.
[8] DU S Q,SHI Y Q,WANG W L,et al.Graph regularized-based semi-supervised non-negative matrix factorization [J].Computer Engineering and Applications,2012,8(36):194-200.(in Chinese) 杜世强,石玉清,王维兰,等.基于图正则化的半监督非负矩阵分解[J].计算机工程与应用,2012,8(36):194-200.
[9] CAI D,HE X F,HAN J W,et al.Graph regularized non-negative matrix factorization for data representation[J].IEEE Trans on Pattern Anal Mach Intell,2011,3(8):1548-1560.
[10] JIANG W,LI H,YU Z G,et al.Graph regularized Non-negative Matrix Factorization with Sparseness Constraints[J].Compu-ter Science,2013,1(40):218-256.(in Chinese) 姜伟,李宏,于震国,等.稀疏约束图正则非负矩阵分解 [J].计算机科学,2013,1(40):218-256.
[11] LIU H F,WU Z H,LI X L,et al.Constrained non-negative matrix factorization for image representation[J].IEEE Trans on Pattern Anal Mach,2012,4(7):1299-1311.
[12] SHU Z Q,ZHAO C X.Constrained non-negative matrix factorization algorithm based on graph regularization and its application in image representation[J].Pattern Recognition and Artificial Intelligence,2013,6(3):300-306.(in Chinese) 舒振球,赵春霞.基于图正则化的受限非负矩阵分解算法及其在图像表示中的应用[J].模式识别与人工智能,2013,6(3):300-306.
[13] BUCAK S S,Gunsel B.Incremental subspace learning via non-negative matrix factorization[J].Pattern Recognition,2009,42(5):788-797.
[14] YU Z Z,LIU Y H,B Li,et al.Incremental Graph Regulated Nonnegative Matrix Factorization[J].Journal of Applied Mathe-matics,2014,4(1):1-10.
[15] DING C,LI T,PENG W,et al.Orthogonal nonnegative matrix t-factorizations for clustering[C]∥Proceedings of SIGKDD.2006:126-135.
[16] LOVASZ L,PLUMMER M.Matching Theory [M].North Holland,1986.
[17] MICHAEL W,SHAKHINA A,STEWART G W.Computingsparse reduced-rank approximations to sparse matrices[J].ACM Transactions on Mathematical Software,2004,9(3):231-235.
[18] WANG W L,CAI J.An incremental learning algorithm for non negative matrix factorization under sparse constraints [J].Computer Science,2014,1(8):241-244.(in Chinese) 王万良,蔡竞.稀疏约束下非负矩阵分解的增量学习算法[J].计算机科学,2014,1(8):241-244.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .