Deep Low-Rank Multi-View Subspace Clustering

被引:0
作者
Yan J. [1 ]
Li Z. [1 ]
Tang Q. [1 ]
Zhou Z. [1 ]
机构
[1] School of Software Engineering, Xi'an Jiaotong University, Xi'an
来源
Li, Zhongyu | 1600年 / Xi'an Jiaotong University卷 / 55期
关键词
Autoencoder; Low-rank representation; Matrix factorization; Multi-view clustering; Subspace clustering;
D O I
10.7652/xjtuxb202111014
中图分类号
学科分类号
摘要
To deal with the problem that the current deep multi-view subspace clustering methods lack robustness due to the lack of low-rank representation constraints on the self-representation matrix, we propose a novel deep low-rank multi-view subspace clustering (DLRMSC) method. Based on the deep multi-view subspace clustering algorithm, the self-expression layer is split into two low-rank linear self-expression layers: the commonly shared self-expression layer and the view-specific self-expression layer, which becomes a double-layer self-expression module with low-rank constraint. To make full use of the complementarity of multi-view data, the parameters of the commonly shared self-expression layer are forced to be the same, but the parameters of specific self-expression layer are different. We embed the self-expression module in the middle of the deep auto-encoder of each view, so as to obtain a deep low-rank multi-view subspace clustering model which can be solved by backpropagation. In the training stage, the commonly shared self-expression layer extracts the common information of multi-view data, the view-specific self-expression layer extracts the specific information of each view, and the double-layer self-expression module guarantees low-rank representation constraint. The experimental results on six public datasets show that compared with the deep multi-view subspace clustering algorithm, the clustering accuracy and normalized mutual information (NMI) of this proposed method on six datasets are significantly improved, where the average accuracy is increased by 0.064 and the average NMI is increased by 0.064. The DLRMSC method substantially outperforms the eleven comparative state-of-the-art clustering methods, and its accuracy is increased by 0.097 and NMI is increased by 0.103 at most. © 2021, Editorial Office of Journal of Xi'an Jiaotong University. All right reserved.
引用
收藏
页码:125 / 135
页数:10
相关论文
共 40 条
[1]  
VIDAL R., Subspace clustering, IEEE Signal Processing Magazine, 28, 2, pp. 52-68, (2011)
[2]  
LAUER F, SCHNORR C., Spectral clustering of linear subspaces for motion segmentation, Proceedings of the 2009 IEEE 12th International Conference on Computer Vision, pp. 678-685, (2009)
[3]  
RAO S, TRON R, VIDAL R, Et al., Motion segmentation in the presence of outlying, incomplete, or corrupted trajectories, IEEE Transactions on Pattern Analysis and Machine Intelligence, 32, 10, pp. 1832-1845, (2010)
[4]  
CAO Xiaochun, ZHANG Changqing, FU Huazhu, Et al., Diversity-induced multi-view subspace clustering, Proceedings of the 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 586-594, (2015)
[5]  
ZHANG Changqing, FU Huazhu, LIU Si, Et al., Low-rank tensor constrained multiview subspace clustering, Proceedings of the 2015 IEEE International Conference on Computer Vision (ICCV), pp. 1582-1590, (2015)
[6]  
NTOUTSI E, STEFANIDIS K, RAUSCH K, Et al., Strength lies in differences": diversifying friends for recommendations through subspace clustering, Proceedings of the 23rd ACM International Conference on Information and Knowledge Management, pp. 729-738, (2014)
[7]  
ZHANG A, FAWAZ N, IOANNIDIS S, Et al., Guess who rated this movie: identifying users through subspace clustering
[8]  
WU Jigang, CHEN Zhaohong, MENG Min, Et al., Survey of subspace learning via low-rank sparse representation, Journal of Huazhong University of Science and Technology (Natural Science Edition), 49, 2, pp. 1-19, (2021)
[9]  
LI Chunguang, VIDAL R., Structured sparse subspace clustering: a unified optimization framework, Proceedings of the 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 277-286, (2015)
[10]  
YOU Chong, ROBINSON D P, VIDAL R., Scalable sparse subspace clustering by orthogonal matching pursuit, Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3918-3927, (2016)