CGD: Multi-View Clustering via Cross-View Graph Diffusion

  • Chang Tang China University of Geosciences (Wuhan)
  • Xinwang Liu National University of Defense Technology
  • Xinzhong Zhu Zhejiang Normal University
  • En Zhu National University of Defense Technology
  • Zhigang Luo National University of Defense Technology
  • Lizhe Wang China University of Geosciences (Wuhan)
  • Wen Gao Peking University


Graph based multi-view clustering has been paid great attention by exploring the neighborhood relationship among data points from multiple views. Though achieving great success in various applications, we observe that most of previous methods learn a consensus graph by building certain data representation models, which at least bears the following drawbacks. First, their clustering performance highly depends on the data representation capability of the model. Second, solving these resultant optimization models usually results in high computational complexity. Third, there are often some hyper-parameters in these models need to tune for obtaining the optimal results. In this work, we propose a general, effective and parameter-free method with convergence guarantee to learn a unified graph for multi-view data clustering via cross-view graph diffusion (CGD), which is the first attempt to employ diffusion process for multi-view clustering. The proposed CGD takes the traditional predefined graph matrices of different views as input, and learns an improved graph for each single view via an iterative cross diffusion process by 1) capturing the underlying manifold geometry structure of original data points, and 2) leveraging the complementary information among multiple graphs. The final unified graph used for clustering is obtained by averaging the improved view associated graphs. Extensive experiments on several benchmark datasets are conducted to demonstrate the effectiveness of the proposed method in terms of seven clustering evaluation metrics.

AAAI Technical Track: Machine Learning