Reweighted Subspace Clustering Guided by Local and Global Structure Preservation

被引:2
作者
Zhou, Jie [1 ,2 ]
Huang, Chucheng [2 ,3 ]
Gao, Can [2 ,3 ]
Wang, Yangbo [4 ]
Pedrycz, Witold [5 ]
Yuan, Ge [2 ,3 ]
机构
[1] Shenzhen Univ, Natl Engn Lab Big Data Syst Comp Technol, Shenzhen 518060, Peoples R China
[2] Shenzhen Inst Artificial Intelligence & Robot Soc, SZU Branch, Shenzhen 518060, Peoples R China
[3] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[4] Commun Univ China, Sch Comp Sci & Cybersecur, Beijing 100024, Peoples R China
[5] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2R3, Canada
基金
中国国家自然科学基金;
关键词
High dimensional data; Clustering methods; Robustness; Noise measurement; Linear programming; Laplace equations; Eigenvalues and eigenfunctions; Computational modeling; Vectors; Training; Local and global structures; projection subspace; reweighting; subspace clustering;
D O I
10.1109/TCYB.2025.3526176
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Subspace clustering has attracted significant interest for its capacity to partition high-dimensional data into multiple subspaces. The current approaches to subspace clustering predominantly revolve around two key aspects: 1) the construction of an effective similarity matrix and 2) the pursuit of sparsity within the projection matrix. However, assessing whether the dimensionality of the projected subspace is the true dimensionality of the data is challenging. Therefore, the clustering performance may decrease when dealing with scenarios such as subspace overlap, insufficient projected dimensions, data noise, etc., since the defined dimensionality of the projected lower-dimensional space may deviate significantly from its true value. In this research, we introduce a novel reweighting strategy, which is applied to projected coordinates for the first time and propose a reweighted subspace clustering model guided by the preservation of the both local and global structural characteristics (RWSC). The projected subspaces are reweighted to augment or suppress the importance of different coordinates, so that data with overlapping subspaces can be better distinguished and the redundant coordinates produced by the predefined number of projected dimensions can be further removed. By introducing reweighting strategies, the bias caused by imprecise dimensionalities in subspace clustering can be alleviated. Moreover, global scatter structure preservation and adaptive local structure learning are integrated into the proposed model, which helps RWSC capture more intrinsic structures and its robustness and applicability can then be improved. Through rigorous experiments on both synthetic and real-world datasets, the effectiveness and superiority of RWSC are empirically verified.
引用
收藏
页码:1436 / 1449
页数:14
相关论文
共 51 条
[1]   Principal component analysis [J].
Abdi, Herve ;
Williams, Lynne J. .
WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL STATISTICS, 2010, 2 (04) :433-459
[2]  
[Anonymous], 2004, SIGKDD EXPLOR NEWSL, DOI DOI 10.1145/1007730.1007731
[3]   Mixtures of robust probabilistic principal component analyzers [J].
Archambeau, Cedric ;
Delannay, Nicolas ;
Verleysen, Michel .
NEUROCOMPUTING, 2008, 71 (7-9) :1274-1282
[4]  
Bai Liang, 2020, PMLR, P561
[5]  
Belkin M, 2002, ADV NEUR IN, V14, P585
[6]   Efficient Deep Embedded Subspace Clustering [J].
Cai, Jinyu ;
Fan, Jicong ;
Guo, Wenzhong ;
Wang, Shiping ;
Zhang, Yunhe ;
Zhang, Zhao .
2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2022), 2022, :21-30
[7]  
Condat L, 2016, MATH PROGRAM, V158, P575, DOI 10.1007/s10107-015-0946-6
[8]   Personalized Recommendation System Based on Collaborative Filtering for IoT Scenarios [J].
Cui, Zhihua ;
Xu, Xianghua ;
Xue, Fei ;
Cai, Xingjuan ;
Cao, Yang ;
Zhang, Wensheng ;
Chen, Jinjun .
IEEE TRANSACTIONS ON SERVICES COMPUTING, 2020, 13 (04) :685-695
[9]  
Demsar J, 2006, J MACH LEARN RES, V7, P1
[10]   Sparse Subspace Clustering: Algorithm, Theory, and Applications [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) :2765-2781