Multi-View Clustering via Nonnegative and Orthogonal Graph Reconstruction.

Area of Science:

• Data Science
• Machine Learning
• Computer Vision

Background:

• Multi-view clustering partitions data based on diverse features.
• Existing methods like spectral clustering and matrix factorization have limitations, including postprocessing needs and high computational costs for large feature sets.

Purpose of the Study:

• To propose a novel multi-view clustering approach that overcomes the limitations of existing methods.
• To enhance computational efficiency and directly obtain clustering results.

Main Methods:

• Developed a method that searches for a common joint graph across multiple views, leveraging inter-view compatibility.
• Introduced a non-negative constraint for direct clustering result acquisition.
• Transformed eigenvalue factorization (O(n^3)) to singular value decomposition (SVD) (O(nc^2)) for improved computational efficiency.

Main Results:

• The proposed method effectively explores hidden structure information by utilizing the compatibility among views.
• Non-negative constraints ensure direct retrieval of clustering outcomes.
• Experimental results demonstrate the superiority of the proposed approach over single-view and state-of-the-art multi-view clustering methods.

Conclusions:

• The novel multi-view clustering approach offers significant advantages in computational efficiency and direct result generation.
• The method effectively integrates information from multiple views, leading to improved clustering performance.
• This approach provides a more efficient and effective solution for multi-view clustering tasks.