Multiview consensus graph clustering

Kun Zhan, Feiping Nie, Jing Wang, Yi Yang

科研成果: 期刊稿件文章同行评审

461 引用 (Scopus)

摘要

A graph is usually formed to reveal the relationship between data points and graph structure is encoded by the affinity matrix. Most graph-based multiview clustering methods use predefined affinity matrices and the clustering performance highly depends on the quality of graph. We learn a consensus graph with minimizing disagreement between different views and constraining the rank of the Laplacian matrix. Since diverse views admit the same underlying cluster structure across multiple views, we use a new disagreement cost function for regularizing graphs from different views toward a common consensus. Simultaneously, we impose a rank constraint on the Laplacian matrix to learn the consensus graph with exactly k connected components where k is the number of clusters, which is different from using fixed affinity matrices in most existing graph-based methods. With the learned consensus graph, we can directly obtain the cluster labels without performing any post-processing, such as k-means clustering algorithm in spectral clustering-based methods. A multiview consensus clustering method is proposed to learn such a graph. An efficient iterative updating algorithm is derived to optimize the proposed challenging optimization problem. Experiments on several benchmark datasets have demonstrated the effectiveness of the proposed method in terms of seven metrics.

源语言英语
文章编号8501973
页(从-至)1261-1270
页数10
期刊IEEE Transactions on Image Processing
28
3
DOI
出版状态已出版 - 3月 2019

指纹

探究 'Multiview consensus graph clustering' 的科研主题。它们共同构成独一无二的指纹。

引用此