Robust Structured Graph Clustering.

Area of Science:

• Machine Learning
• Data Mining
• Computer Science

Background:

• Graph-based clustering methods partition data using similarity graphs.
• Existing methods struggle with noisy data and separate graph construction/clustering steps, leading to suboptimal performance.

Purpose of the Study:

• To propose a robust structured graph clustering (RSGC) model.
• To simultaneously learn a robust structured similarity graph and perform clustering for improved accuracy.

Main Methods:

• Developed a novel framework for simultaneous robust structured graph learning and clustering.
• Employed a latent representation resistant to noise and outliers for adaptive graph learning.
• Incorporated a rank constraint on the Laplacian matrix to structure the graph and match the cluster number.

Main Results:

• The RSGC model effectively handles noisy data and outliers.
• Achieved direct cluster label extraction from the learned similarity graph.
• Demonstrated superior performance over state-of-the-art methods on synthetic and real datasets.

Conclusions:

• The proposed RSGC model offers a robust and effective approach to graph-based clustering.
• Simultaneous learning of a structured graph and clustering enhances performance, especially with noisy data.