Abstract
Traditional multi-view clustering (MVC) methods often rely on coarse-grained, view-wise fusion, which can be sensitive to noise and fails to capture the intricate manifold structures of high-dimensional data. This paper introduces a novel multi-view graph clustering framework that shifts the focus toward a more precise "sample-wise" approach. By learning the underlying topological relevance of data and weighting the importance of different views for every individual sample, the proposed method achieves state-of-the-art performance while remaining robust to noise in specific data sources.
Introduction
In the real world, data objects are frequently described by multiple features or "views." For instance, an image can be characterized by color, texture, and shape, while a webpage may be defined by its text content and its hyperlink network. Multi-view clustering (MVC) aims to integrate these diverse perspectives to uncover a consistent underlying structure.
However, existing MVC methods face two major hurdles. First, they often treat data as if it exists in simple Euclidean space, ignoring the "topological structure"—the idea that data points might be related through a chain of neighbors on a curved manifold. Second, most methods employ coarse-grained fusion, assigning a single weight to an entire view. This is problematic when a view is informative for some samples but noisy for others. For example, a color-based view might be excellent for identifying a red car but misleading for a translucent glass bottle.
Methodology
The proposed framework addresses these limitations through three key components:
1. Topological Relevance Learning
Instead of relying on simple geometric similarity, the model learns the "topological relevance" between points. This ensures that if point A is a neighbor of B, and B is a neighbor of C, A and C are treated as highly consistent even if they are geometrically distant in the original feature space.
2. Sample-level Graph Fusion
This is the core innovation of the work. The authors arrange the multi-view data into a 3D tensor and "slice" it by sample. This allows the model to learn a specific weight matrix ($W$) for every single data point. If a specific view is noisy for a particular sample, the model can automatically down-weight it for that instance while maintaining its importance for others.
3. The Intermediate Variable ($Q$)
To bridge the gap between raw topological learning and the final fused graph, the authors introduce a variable $Q$. This acts as a "buffer" that helps the optimization process find a consensus across views without being forced into a sub-optimal structure by a single "bad" view. The resulting non-convex optimization problem is solved efficiently using an iterative algorithm based on the Augmented Lagrangian Multiplier (ALM) method.
Experimental Evaluation
The researchers evaluated their method on six diverse benchmark datasets, including plant species (100leaves), handwritten numerals (HW), general images (MSRC), faces (ORL & Yale), and web pages (Cornell).
Key Results
The proposed method consistently outperformed 13 other state-of-the-art (SOTA) methods across metrics such as Accuracy (ACC) and Normalized Mutual Information (NMI):
- Handwritten Numerals (HW): Achieved a near-perfect 99.25% Accuracy and 98.15% NMI.
- 100leaves: Reached 90.86% Accuracy, significantly gapping SOTA methods that typically ranged between 35% and 77%.
- Robustness: Parameter analysis demonstrated that the model is remarkably stable across a wide range of hyperparameter settings ($\alpha, \beta, \lambda, \gamma$).
Conclusion
By treating multi-view fusion as a local, sample-level problem rather than a global, view-wise one, this framework more accurately reflects the behavior of real-world data. The integration of manifold awareness and sample-level weighting provides a robust solution to the challenges of noise and inconsistent data structures. Future work will explore extending this logic into deep learning and kernel-based frameworks to handle even more complex, non-linear relationships.
Summary updated