Robust multi-view clustering via structure regularization concept factorization

被引:0
作者
Hu, Xuemin [1 ]
Xiong, Dan [1 ]
Chai, Li [2 ]
机构
[1] Wuhan Univ Sci & Technol, Sch Informat Sci & Engn, Wuhan 430081, Peoples R China
[2] Zhejiang Univ, Coll Control Sci & Engn, State Key Lab Ind Control Technol, Hangzhou 310027, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-view clustering; Robustness; Global structure; Dual graph regularization; NONNEGATIVE MATRIX FACTORIZATION; DIMENSIONALITY REDUCTION; GRAPH; CONSENSUS;
D O I
10.1016/j.dsp.2024.104713
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recently, many concept factorization-based multi-view clustering methods have been proposed and achieved promising results on text multi-view data. However, existing methods are limited in the following two aspects. (1) The Frobenius norm used in these methods is sensitive to noise and outliers; (2) These methods ignore the global structural information of the data. To address the above problems, we propose a robust concept factorization framework for multi-view clustering, which not only improves the robustness but also fully exploits the available information of multi-view data. Specifically, L 2,1-norm is used to evaluate the error of the factorization, thus eliminating the effect of outliers and improving robustness. In addition, to retain more structure information of the original data, the global and local structure information are taken into consideration simultaneously, which makes the learned low-dimensional matrix more discriminative. Further, to make use of the complementary information of the different views, we introduce an adaptive weight learning strategy to assign weights for different views. An iterative updating algorithm is proposed to solve the proposed optimization problem. We compare the proposed method with state-of-the-art alternative methods on benchmark multi-view data sets. The extensive experimental results show the effectiveness and superiority of the proposed method.
引用
收藏
页数:15
相关论文
共 54 条
[1]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[2]  
Boyd S., 2004, Convex Optimization, DOI 10.1017/CBO9780511804441
[3]   Auto-weighted multi-view clustering with the use of an augmented view [J].
Cai, Bing ;
Lu, Gui-Fu ;
Wan, Jiashan ;
Du, Yangfan .
SIGNAL PROCESSING, 2024, 215
[4]  
CAI X., 2013, 23 INT JOINT C ARTIF, P2598
[5]   Multi-view clustering via deep concept factorization [J].
Chang, Shuai ;
Hu, Jie ;
Li, Tianrui ;
Wang, Hao ;
Peng, Bo .
KNOWLEDGE-BASED SYSTEMS, 2021, 217
[6]  
Gu QQ, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P359
[7]  
Hoyer PO, 2004, J MACH LEARN RES, V5, P1457
[8]  
Hu XM, 2024, CHIN CONTR CONF, P3339, DOI 10.23919/CCC63176.2024.10662328
[9]   Robust sparse concept factorization with graph regularization for subspace learning [J].
Hu, Xuemin ;
Xiong, Dan ;
Chai, Li .
DIGITAL SIGNAL PROCESSING, 2024, 150
[10]   Higher Order Connection Enhanced Community Detection in Adversarial Multiview Networks [J].
Huang, Ling ;
Wang, Chang-Dong ;
Yu, Philip S. .
IEEE TRANSACTIONS ON CYBERNETICS, 2023, 53 (05) :3060-3074