Neighbor-relation aware low-rank multi-view subspace clustering

被引:0
作者
Jia, Hongjie [1 ,2 ]
Wang, Tengteng [1 ]
Song, Heping [1 ]
机构
[1] Jiangsu Univ, Sch Comp Sci & Commun Engn, Zhenjiang 212013, Peoples R China
[2] Jiangsu Engn Res Ctr Big Data Ubiquitous Percept &, Zhenjiang 212013, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Subspace clustering; Multi-view clustering; Low-rank structure; Neighbor-relation awareness; NEAR-INFRARED SPECTROSCOPY;
D O I
10.1007/s00530-025-01792-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Low-rank multi-view subspace clustering seeks to uncover complex relationships in high-dimensional data by leveraging multiple views and low-rank representations. However, two key challenges persist: (1) Existing methods emphasize low-rank consistency through nuclear norm regularization but often overlook the unique low-rank features of individual views. (2) Constructing the affinity matrix directly from the coefficient matrix can introduce excessive connections, degrading clustering performance. To address these challenges, we propose neighbor-relation aware low-rank multi-view subspace clustering (NLMSC), a unified model that integrates view-specific low-rank structure learning with neighbor-aware affinity fusion. NLMSC decomposes the coefficient matrix into smaller factor matrices to capture the underlying low-rank structures of each view and constructs a sparser, more interpretable affinity matrix by reliable neighbor selection. These affinity matrices are then fused into a block-diagonal consensus graph through a self-weighting strategy for spectral clustering. Extensive experiments on diverse multi-view datasets demonstrate NLMSC's superior performance and effectiveness in challenging clustering tasks.
引用
收藏
页数:16
相关论文
共 46 条
[1]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[2]   Multi-view low-rank sparse subspace clustering [J].
Brbic, Maria ;
Kopriva, Ivica .
PATTERN RECOGNITION, 2018, 73 :247-258
[3]   High-order manifold regularized multi-view subspace clustering with robust affinity matrices and weighted TNN [J].
Cai, Bing ;
Lu, Gui-Fu ;
Yao, Liang ;
Li, Hua .
PATTERN RECOGNITION, 2023, 134
[4]   Seeking commonness and inconsistencies: A jointly smoothed approach to multi-view subspace clustering [J].
Cai, Xiaosha ;
Huang, Dong ;
Zhang, Guang-Yu ;
Wang, Chang-Dong .
INFORMATION FUSION, 2023, 91 :364-375
[5]  
Chen MS, 2020, AAAI CONF ARTIF INTE, V34, P3513
[6]   M-pSC: a manifoldp-spectral clustering algorithm [J].
Ding, Ling ;
Ding, Shifei ;
Wang, Yanru ;
Wang, Lijuan ;
Jia, Hongjie .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2021, 12 (02) :541-553
[7]   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
[8]   Unified Low-Rank Tensor Learning and Spectral Embedding for Multi-View Subspace Clustering [J].
Fu, Lele ;
Chen, Zhaoliang ;
Chen, Yongyong ;
Wang, Shiping .
IEEE TRANSACTIONS ON MULTIMEDIA, 2023, 25 :4972-4985
[9]   Low-rank tensor approximation with local structure for multi-view intrinsic subspace clustering [J].
Fu, Lele ;
Yang, Jinghua ;
Chen, Chuan ;
Zhang, Chuanfu .
INFORMATION SCIENCES, 2022, 606 :877-891
[10]   A Similarity Matrix Low-Rank Approximation and Inconsistency Separation Fusion Approach for Multiview Clustering [J].
He Z. ;
Wan S. ;
Zappatore M. ;
Lu H. .
IEEE Transactions on Artificial Intelligence, 2024, 5 (02) :868-881