Multiview Consensus Graph Clustering.

Area of Science:

• Machine Learning
• Data Mining
• Graph Theory

Background:

• Graph-based clustering relies heavily on affinity matrices, whose quality dictates performance.
• Existing methods often use predefined matrices, limiting adaptability and accuracy.
• Multiview data presents challenges due to varying representations.

Purpose of the Study:

• To develop a multiview consensus clustering method that learns an optimal consensus graph.
• To improve clustering performance by minimizing disagreement across multiple data views.
• To eliminate the need for post-processing steps like k-means clustering.

Main Methods:

• Learning a consensus graph by minimizing disagreement between different views.
• Constraining the rank of the Laplacian matrix to ensure connected components equal the number of clusters.
• Developing an efficient iterative algorithm for optimization.
• Utilizing a novel disagreement cost function for graph regularization.

Main Results:

• The proposed method directly obtains cluster labels from the learned consensus graph.
• Experimental results on benchmark datasets demonstrate significant effectiveness.
• The method achieved superior performance across seven evaluation metrics.

Conclusions:

• The developed multiview consensus clustering method effectively learns a robust consensus graph.
• The approach enhances clustering accuracy and efficiency by integrating multiple data views.
• This method offers a promising alternative to traditional graph-based clustering techniques.