Adaptive Weighted Graph Fusion Incomplete Multi-View Subspace Clustering

Area of Science:

• Data Science
• Machine Learning
• Computer Vision

Background:

• Multi-view clustering (MVC) is crucial for analyzing diverse data sources.
• Existing MVC methods often assume complete data, which is unrealistic in practice.
• Incomplete multi-view data presents significant challenges for traditional clustering algorithms.

Purpose of the Study:

• To develop a robust method for incomplete multi-view clustering.
• To enhance clustering performance by effectively fusing information from incomplete views.
• To address noise and view inconsistency in multi-view data analysis.

Main Methods:

• Proposed an adaptive weighted graph fusion incomplete multi-view subspace clustering (AWGF-IMSC) method.
• Transformed data into latent representations to reduce noise and improve graph construction.
• Integrated feature extraction and incomplete graph fusion within a unified framework.
• Employed sparse regularization for robustness against view inconsistency and automatically learned view importance.

Main Results:

• The proposed AWGF-IMSC method demonstrated superior performance compared to state-of-the-art methods.
• Experiments on real-world datasets validated the effectiveness and advancement of the approach.
• The method showed robustness in handling incomplete multi-view data.

Conclusions:

• The AWGF-IMSC method offers a significant advancement in incomplete multi-view clustering.
• The adaptive fusion and robust graph construction effectively handle data incompleteness and noise.
• This work provides a valuable tool for real-world applications involving incomplete multi-view data.