Multi-view projected clustering with graph learning.

Area of Science:

• Machine Learning
• Data Science
• Computer Vision

Background:

• Graph-based multi-view learning offers effective clustering but struggles with noisy, high-dimensional data.
• Existing methods often fail to select relevant features, leading to inaccurate graph construction.

Purpose of the Study:

• To develop a novel framework integrating dimensionality reduction, manifold structure learning, and feature selection.
• To enhance the accuracy of graph construction and improve clustering performance in multi-view learning.

Main Methods:

• Mapping high-dimensional data to a low-dimensional space to mitigate noise and redundancy.
• Employing L21-norm regularization for adaptive selection of crucial features.
• Developing an efficient algorithm to optimize the model.

Main Results:

• The proposed method effectively reduces data complexity and noise.
• Adaptive feature selection demonstrably improves clustering accuracy.
• Experimental results on benchmark datasets confirm the method's superiority.

Conclusions:

• The integrated framework offers a robust solution for multi-view learning challenges.
• The approach yields more reliable graph structures and superior clustering outcomes.
• This method advances the field of graph-based multi-view learning by addressing key limitations.