Affiliation:
1. School of Mathematics and Statistics, Guangdong University of Technology, Guangzhou 510520, China
Abstract
Multi-view subspace clustering is an effective method that has been successfully applied to many applications and has attracted the attention of scholars. Existing multi-view subspace clustering seeks to learn multiple representations from different views, then gets a consistent matrix. Until now, most of the existing efforts only consider the multi-view information and ignore the feature concatenation. It may fail to explore their high correlation. Consequently, this paper proposes a multi-view subspace clustering algorithm with a novel consensus matrix construction strategy. It learns a consensus matrix by fusing the different information from multiple views and is enhanced by the information contained in the original feature direct linkage of the data. The error matrix of the feature concatenation data is reconstructed by regularization constraints and the sparse structure of the multi-view subspace. The feature concatenation data are simultaneously used to fuse the individual views and learn the consensus matrix. Finally, the data is clustered by using spectral clustering according to the consensus matrix. We compare the proposed algorithm with its counterparts on six datasets. Experimental results verify the effectiveness of the proposed algorithm.
Funder
Natural Science Foundation of Guangdong Province
Guangdong Provincial Key Laboratory of Cyber-Physical System
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献