计算机科学

计算机科学 ›› 2023, Vol. 50 ›› Issue (7): 89-97.doi: 10.11896/jsjkx.220500050

• 数据库&大数据&数据科学 • 上一篇    下一篇

基于约束图正则的块稀疏对称非负矩阵分解

刘威, 邓秀勤, 刘冬冬, 刘玉兰   

  1. 广东工业大学数学与统计学院 广州 510000
  • 收稿日期:2022-05-06 修回日期:2022-09-12 出版日期:2023-07-15 发布日期:2023-07-05
  • 通讯作者: 邓秀勤(dxq706@gdut.edu.cn)
  • 作者简介:(2534652861@qq.com)
  • 基金资助:
    国家自然科学基金(12101136);广东省研究生教育创新计划项目(2021SFKC030);广州市科技基金(202102020273);广东省区域联合基金(2020A1515110967);重庆师范大学数学学科省部级重点实验室开放课题(CSSXKFKTQ202002)

Block Sparse Symmetric Nonnegative Matrix Factorization Based on Constrained Graph Regularization

LIU Wei, DENG Xiuqin, LIU Dongdong, LIU Yulan   

  1. School of Mathematics and Statistics,Guangdong University of Technology,Guangzhou 510000,China
  • Received:2022-05-06 Revised:2022-09-12 Online:2023-07-15 Published:2023-07-05
  • About author:LIU Wei,born in 1996,postgraduate.His main research interests include machine learning and data mining.DENG Xiuqin,born in 1966,professor,master supervisor.Her main research interests include machine learning and data mining.
  • Supported by:
    National Natural Science Foundation of China(12101136),Postgraduate Educational Innovation program of Guangdong(2021SFKC030),Science and Technology Foundation of Guangzhou(202102020273),Regional Join foundation of Guangdong(2020A1515110967) and Open project of Provincial Key Laboratory of Mathematics,Chongqing Normal University(CSSXKFKTQ202002).

PDF (PC)

241

摘要： 现有的基于对称非负矩阵因式分解(Symmetric Nonnegative matrix Factorization,SymNMF)算法大都仅依赖初始数据构造亲和矩阵,并且一定程度上忽视了样本有限的成对约束信息,无法有效区分不同类别的相似样本以及学习样本的几何特征。针对以上问题,提出了基于约束图正则的块稀疏对称非负矩阵分解(Block Sparse Symmetric Nonnegative Matrix Factorization Based on Constrained Graph Regularization,CGBS-SymNMF)。首先,通过先验信息构造约束图矩阵,用于指导类别指示矩阵区分高相似度的不同类别样本;然后,引入PCP-SDP(Pairwise Constraint Propagation by Semi-definite Programming)方法,利用成对约束学习一个新的样本图映射矩阵;最后,利用“勿连”约束构造不相似矩阵,用于引导一个块稀疏正则项,以增强模型抗噪能力。实验结果表明,所提算法具有更高的聚类精确度和稳定性。

关键词: 对称非负矩阵因式分解, 亲和矩阵, 成对约束, 图正则, 块稀疏

Abstract: The existing algorithms based on symmetric nonnegative matrix factorization(SymNMF) are mostly rely on initial data to construct affinity matrices,and neglect the limited pairwise constraints,so these methods are unable to effectively distinguish similar samples of different categories or learn the geometric features of samples.To solve the above problems,this paper proposes a block sparse symmetric nonnegative matrix factorization based on constrained graph regularization(CGBS-SymNMF).Firstly,the constrained graph matrix is constructed by prior information,which is used to guide the clustering indicator matrix to distinguish different clusters of samples with high similarity.Secondly,pairwise constraint propagation by semidefinite programming(PCP-SDP) is introduced to learn a new sample graph mapping matrix by using pairwise constraints.Finally,a dissimilarity matrix is constructed by cannot-link constraints,which is used to guide a block sparse regular term for enhancing the anti-noise capability of the model.Experimental results demonstrate a higher clustering accuracy and stability of the proposed algorithm.

Key words: Symmetric nonnegative matrix factorization, Affinity matric, Pairwise constraint, Graph regularization, Block sparse

中图分类号: 

  • TP301.6
[1]LEE D D, SEUNG H S.Learning the parts of objects by nonnegative matrix factorization[J].Nature,1999,401(6755):788-791.
[2]SHAHBAZI Z,BYUN Y C.Topic modeling in short-text using non-negative matrix factorization based on deep reinforcement learning[J].Journal of Intelligent & Fuzzy Systems,2020,39(1):753-770.
[3]LAXMI LYDIA E,KRISHNA KUMAR P,SHANKAR K,et al.Charismatic document clustering through novel K-Means non-negative matrix factorization(KNMF) algorithm using key phrase extraction[J].International Journal of Parallel Programming,2020,48(3):496-514.
[4]HASSANI A,IRANMANESH A,MANSOURI N.Text mining using nonnegative matrix factorization and latent semantic ana-lysis[J].Neural Computing and Applications,2021,33(20):13745-13766.
[5]SHAHBAZI Z,BYUN Y C.Topic modeling in short-text using non-negative matrix factorization based on deep reinforcement learning[J].Journal of Intelligent & Fuzzy Systems,2020,39(1):753-770.
[6]MCGRAW T,KANG J,HERRING D.Sparse non-negative matrix factorization for mesh segmentation[J].International Journal of Image and Graphics,2016,16(1):1650004.
[7]LIU H,WU J,SUN J Y,et al.A robust segmentation method with triple-factor non-negative matrix factorization for myocardial blood flow quantification from dynamic 82Rb positron emission tomography[J].Medical Physics,2019,46(11):5002-5013.
[8]TIAN L,DU Q,KOPRIVA I,et al.Orthogonal graph-regula-rized non-negative matrix factorization for hyperspectral image clustering[C]//IEEE International Geoscience and Remote Sensing Symposium.Piscataway:IEEE,2019:795-798.
[9]YANG Z,ZHANG Y,XIANG Y,et al.Non-negative matrix factorization with dual constraints for image clustering[J].IEEE Transactions on Systems,Man,and Cybernetics:Systems,2018,50(7):2524-2533.
[10]CAI D,HE X,HAN J,et al.Graph regularized nonnegative matrix factorization for data representation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2010,33(8):1548-1560.
[11]ZHOU C,LI X L,LI Q L,et al.Sparse Non-negative Matrix Factorization Algorithm Based on Cosine Similarity[J].Compu-ter Science,2020,47(10):108-113.
[12]HE Z,XIE S,ZDUNEK R,et al.Symmetric nonnegative matrix factorization:Algorithms and applications to probabilistic clustering[J].IEEE Transactions on Neural Networks,2011,22(12):2117-2131.
[13]DOBROVOLSKYI H,KEBERLE N,TERNOVYY Y.Sparsesymmetric nonnegative matrix factorization applied to face recognition[C]//IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems:Technology and Applications(IDAACS).Piscataway:IEEE,2017:1042-1045.
[14]GAO Z,GUAN N,SU L.Graph Regularized Symmetric Non-Negative Matrix Factorization for Graph Clustering[C]//2018 IEEE International Conference on Data Mining Workshops(ICDMW).Piscataway:IEEE,2018:379-384.
[15]YANG L,CAO X,JIN D,et al.A unified semi-supervised community detection framework using latent space graph regularization[J].IEEETransactions on Cybernetics,2014,45(11):2585-2598.
[16]ZHANG X,ZONG L,LIU X,et al.Constrained clustering with nonnegative matrix factorization[J].IEEETransactions on Neural Networks and Learning Systems,2015,27(7):1514-1526.
[17]JIA Y,LIU H,HOU J,et al.Semisupervised adaptive symmetric non-negative matrix factorization[J].IEEE Transactions on Cybernetics,2020,51(5):2550-2562.
[18]WU W,JIA Y,KWONG S,et al.Pairwise constraint propagation-induced symmetric nonnegative matrix factorization[J].IEEE Transactions on Neural Networks and Learning Systems,2018,29(12):6348-6361.
[19]PENG C,ZHANG Z,KANG Z,et al.Nonnegative matrix fac-torization with local similarity learning[J].Information Sciences,2021,562(8):325-346.
[20]QIN Y,WU H,FENG G.Structured subspace learning-induced symmetric nonnegative matrix factorization[J].Signal Proces-sing,2021,186(12):108115.
[21]PARK S,ZHAO H.Spectral clustering based on learning similarity matrix[J].Bioinformatics,2018,34(12):2069-2076.
[22]QIN Y,WU H,FENG G.Structured subspace learning-induced symmetric nonnegative matrix factorization[J].Signal Proces-sing,2021,186(12):108115.
[23]WANG S,LI G,HU G,et al.Community detection in dynamic networks using constraint non-negative matrix factorization[J].Intelligent Data Analysis,2020,24(1):119-139.
[24]JIA Y,LIU H,HOU J,et al.Pairwise constraint propagation with dual adversarial manifold regularization[J].IEEE Transactions on Neural Networks and Learning Systems,2020,31(12):5575-5587.
[25]JIA Y,WU W,WANG R,et al.Joint optimization for pairwise constraint propagation[J].IEEE Transactions on Neural Networks and Learning Systems,2020,32(7):3168-3180.
[26]BAI L,LIANG J Y,CAO F.Semi-supervised clustering withconstraints of different types from multiple information sources[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2020,43(9):3247-3258.
[27]LI Z,LIU J,TANG X.Pairwise constraint propagation by semidefinite programming for semi-supervised classification[C]//Proceedings of the 25th International Conference on Machine Learning.Berlin:Springer,2008:576-583.
[28]QIN Y,DING S F.Survey of Semi-supervised Clustering [J].Computer Science,2019,46(9):15-21.
[29]SPIELMAN D A.Spectral graph theory and its applications[C]//48th Annual IEEE Symposium on Foundations of Computer Science(FOCS’07).Piscataway:IEEE,2007:29-38.
[30]LEMON A,SO A M C,YE Y.Low-rank semidefinite programming:Theory and applications[M].Boston:Now Publishers,2016:6-17.
[31]HANG M, YUAN J L, PANG L P,et al.UV-theory of a Class of Semidefinite Programming and Its Applications[J].Acta Mathematicae Applicatae Sinica,2021,37(4):717-737.
[32]WONG W K,YIN Y,ZHOU J.Using SeDuMi to find various optimal designs for regression models[J].Statistical Papers,2019,60(5):1583-1603.
[33]LU C,FENG J,LIN Z,et al.Subspace clustering by block diagonal representation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2018,41(2):487-501.
[34]JIA Y,HOU J,KWONG S.Constrained clustering with dissimilarity propagation-guided graph-Laplacian PCA[J].IEEE Transactions on Neural Networks and Learning Systems,2020,32(9):3985-3997.
[35]HASSAN S N H B,NIIMI T,YAMASHITA N.Augmented lagrangian method with alternating constraints for nonlinear optimization problems[J].Journal of Optimization Theory and Applications,2019,181(3):883-904.
[36]JIA Y,KWONG S,HOU J,et al.Semi-supervised non-negative matrix factorization with dissimilarity and similarity regularization[J].IEEE Transactions on Neural Networks and Learning Systems,2019,31(7):2510-2521.
[37]LI Z,TANG J,HE X.Robust structured nonnegative matrix factorization for image representation[J].IEEE Transactions on Neural Networks and Learning Systems,2018,29(5):1947-1960.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
渝ICP备16013121号-4
地址：重庆市渝北区洪湖西路18号    邮编：401121  
电话：023-63500828（编辑部） 023-67039612（会议/专题） 023-67039623（财务/发票）
E-mail：jsjkx12@163.com
本系统由北京玛格泰克科技发展有限公司设计开发