Deep Multi-View Clustering Based on Reconstructed Self-Expressive Matrix

被引:8
作者
Shi, Zonghan [1 ]
Zhao, Haitao [1 ]
机构
[1] East China Univ Sci & Technol, Sch Informat Sci & Engn, Automat Dept, Shanghai 200237, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2023年 / 13卷 / 15期
基金
中国国家自然科学基金;
关键词
multi-view learning; subspace clustering; self-expressive matrix; deep learning; ALGORITHM;
D O I
10.3390/app13158791
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Deep Multi-view Subspace Clustering is a powerful unsupervised learning technique for clustering multi-view data, which has achieved significant attention during recent decades. However, most current multi-view clustering methods rely on learning self-expressive layers to obtain the ultimate clustering results, where the size of the self-expressive matrix increases quadratically with the number of input data points, making it difficult to handle large-scale datasets. Moreover, since multiple views are rich in information, both consistency and specificity of the input images need to be considered. To solve these problems, we propose a novel deep multi-view clustering approach based on the reconstructed self-expressive matrix (DCRSM). We use a reconstruction module to approximate self-expressive coefficients using only a small number of training samples, while the conventional self-expressive model must train the network with entire datasets. We also use shared layers and specific layers to integrate consistent and specific information of features to fuse information between views. The proposed DCRSM is extensively evaluated on multiple datasets, including Fashion-MNIST, COIL-20, COIL-100, and YTF. The experimental results demonstrate its superiority over several existing multi-view clustering methods, achieving an improvement between 1.94% and 4.2% in accuracy and a maximum improvement of 4.5% in NMI across different datasets. Our DCRSM also yields competitive results even when trained by 50% samples of the whole datasets.
引用
收藏
页数:18
相关论文
共 64 条
[11]   Neighbor-aware deep multi-view clustering via graph convolutional network [J].
Du, Guowang ;
Zhou, Lihua ;
Li, Zhongxue ;
Wang, Lizhen ;
Lu, Kevin .
INFORMATION FUSION, 2023, 93 :330-343
[12]   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
[13]   One2Multi Graph Autoencoder for Multi-view Graph Clustering [J].
Fan, Shaohua ;
Wang, Xiao ;
Shi, Chuan ;
Lu, Emiao ;
Lin, Ken ;
Wang, Bai .
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, :3070-3076
[14]  
Gao QX, 2020, AAAI CONF ARTIF INTE, V34, P3938
[15]   Generative Adversarial Networks [J].
Goodfellow, Ian ;
Pouget-Abadie, Jean ;
Mirza, Mehdi ;
Xu, Bing ;
Warde-Farley, David ;
Ozair, Sherjil ;
Courville, Aaron ;
Bengio, Yoshua .
COMMUNICATIONS OF THE ACM, 2020, 63 (11) :139-144
[16]  
Guo XF, 2017, PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P1753
[17]   Reducing the dimensionality of data with neural networks [J].
Hinton, G. E. ;
Salakhutdinov, R. R. .
SCIENCE, 2006, 313 (5786) :504-507
[18]   Auto-weighted multi-view clustering via deep matrix decomposition [J].
Huang, Shudong ;
Kang, Zhao ;
Xu, Zenglin .
PATTERN RECOGNITION, 2020, 97
[19]  
Huang ZY, 2019, PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2563
[20]  
Ji P, 2017, 31st International Conference on Neural Information Processing Systems