Adaptive Semi-supervised Multi-view Clustering Based on Hypergraph Regular NMF
Although graph regularized non-negative matrix factorization(GNMF)has become the basic framework for a large number of multi-view clustering methods,it is undoubtedly a great challenge to fuse complex data relationships from different views with a simple graph and obtain a consistent discriminative representation at the same time.In order to better deal with the clustering task of multi-view data,a semi-supervised multi-view clustering method based on hypergraph regularized non-negative matrix factorization is proposed.Specifically,by constructing a hypergraph,this method learns the high-order relationships of data from multiple views.In order to make reasonable use of the label information available in the real world,the label constraint is introduced for semi-supervised learning.In addition,this method considers the learning of consistency information and complementarity information at the same time,adopts adaptive measures to distinguish the contributions of different views,and uses an alternating iterative algorithm to optimize the objective function.The comparative experimental results on 7 real datasets show that the proposed algorithm is superior to other classical algorithms and current advanced algorithms in ACC and NMI indicators on 6 datasets.
国家科技期刊平台
NSTL
万方数据
