Graph Learning for Multiview Clustering.

Area of Science:

• Machine Learning
• Data Mining
• Computer Science

Background:

• Traditional graph-based clustering methods rely on predefined graphs, making performance sensitive to graph quality.
• Existing multiview clustering techniques often struggle with integrating information from diverse data sources effectively.

Purpose of the Study:

• To develop an improved multiview clustering algorithm by enhancing graph quality through graph learning.
• To propose a method that directly obtains cluster indicators, bypassing conventional graph cut and k-means clustering.

Main Methods:

• A graph learning-based method is proposed to learn and optimize initial graphs from different data views.
• A rank constraint is applied to the Laplacian matrix during graph optimization and integration into a global graph.
• A novel optimization procedure integrates optimized graphs into a unified global graph with a rank constraint.

Main Results:

• The proposed method successfully generates high-quality graphs for multiview clustering.
• Cluster indicators are directly derived from the optimized global graph, demonstrating the efficacy of the rank constraint.
• Experimental results on benchmark datasets show superior performance compared to state-of-the-art multiview clustering algorithms.

Conclusions:

• The proposed graph learning-based multiview clustering algorithm effectively improves clustering performance by learning optimal graphs.
• The rank constraint on the Laplacian matrix is a key innovation enabling direct cluster indicator extraction.
• The method offers a robust and superior alternative to existing multiview clustering techniques.