Global-Graph Guided and Local-Graph Weighted Contrastive Learning for Unified Clustering on Incomplete and Noise Multi-View Data

• URL: http://arxiv.org/abs/2512.21516v1
• Date: Thu, 25 Dec 2025 05:41:05 GMT
• Title: Global-Graph Guided and Local-Graph Weighted Contrastive Learning for Unified Clustering on Incomplete and Noise Multi-View Data
• Authors: Hongqing He, Jie Xu, Wenyuan Yang, Yonghua Zhu, Guoqiu Wen, Xiaofeng Zhu,
• Abstract summary: Real-world multi-view data suffer from data incompleteness or noise, resulting in rare-paired samples or mis-paired samples.<n>We propose a unified CL-based MVC framework for enhancing clustering effectiveness on incomplete and noise multi-view data.<n>Our method is imputation-free and can be integrated into a unified global-local graph-guided contrastive learning framework.
• Score: 17.546021510992908
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently, contrastive learning (CL) plays an important role in exploring complementary information for multi-view clustering (MVC) and has attracted increasing attention. Nevertheless, real-world multi-view data suffer from data incompleteness or noise, resulting in rare-paired samples or mis-paired samples which significantly challenges the effectiveness of CL-based MVC. That is, rare-paired issue prevents MVC from extracting sufficient multi-view complementary information, and mis-paired issue causes contrastive learning to optimize the model in the wrong direction. To address these issues, we propose a unified CL-based MVC framework for enhancing clustering effectiveness on incomplete and noise multi-view data. First, to overcome the rare-paired issue, we design a global-graph guided contrastive learning, where all view samples construct a global-view affinity graph to form new sample pairs for fully exploring complementary information. Second, to mitigate the mis-paired issue, we propose a local-graph weighted contrastive learning, which leverages local neighbors to generate pair-wise weights to adaptively strength or weaken the pair-wise contrastive learning. Our method is imputation-free and can be integrated into a unified global-local graph-guided contrastive learning framework. Extensive experiments on both incomplete and noise settings of multi-view data demonstrate that our method achieves superior performance compared with state-of-the-art approaches.

Related papers

• SMART: Semantic Matching Contrastive Learning for Partially View-Aligned Clustering [46.33455475152849]
  Partially View-aligned Clustering aims to learn correspondences between misaligned view samples.<n>Our approach is to alleviate the influence of cross-view distributional shifts, thereby facilitating semantic matching contrastive learning.<n>Our method consistently outperforms existing approaches on the PVC problem.
  arXiv  Detail & Related papers  (2025-12-17T12:48:41Z)
• Incomplete Multi-view Clustering via Diffusion Contrastive Generation [10.303281347345955]
  We propose a novel IMVC method called Diffusion Contrastive Generation (DCG)<n>DCG learns the distribution characteristics to enhance clustering by applying forward diffusion and reverse denoising processes to intra-view data.<n>It integrates instance-level and category-level interactive learning to exploit the consistent and complementary information available in multi-view data.
  arXiv  Detail & Related papers  (2025-03-12T09:27:25Z)
• Joint Tensor and Inter-View Low-Rank Recovery for Incomplete Multiview Clustering [35.261304932451544]
  This paper proposes a novel joint tensor and inter-view low-rank Recovery (JTIV-LRR) for incomplete multiview clustering.<n>It achieves significant improvements in clustering accuracy and robustness compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-03-04T09:50:59Z)
• Balanced Multi-view Clustering [56.17836963920012]
  Multi-view clustering (MvC) aims to integrate information from different views to enhance the capability of the model in capturing the underlying data structures.<n>The widely used joint training paradigm in MvC is potentially not fully leverage the multi-view information.<n>We propose a novel balanced multi-view clustering (BMvC) method, which introduces a view-specific contrastive regularization (VCR) to modulate the optimization of each view.
  arXiv  Detail & Related papers  (2025-01-05T14:42:47Z)
• Partial Multi-View Clustering via Meta-Learning and Contrastive Feature Alignment [13.511433241138702]
  Partial multi-view clustering (PVC) presents significant challenges practical research problem for data analysis in real-world applications. Existing clustering methods struggle to handle incomplete views effectively, leading to suboptimal clustering performance. We propose a novel dual optimization framework based on contrastive learning, which aims to maximize the consistency of latent features in incomplete multi-view data.
  arXiv  Detail & Related papers  (2024-11-14T19:16:01Z)
• URRL-IMVC: Unified and Robust Representation Learning for Incomplete Multi-View Clustering [28.776476995363048]
  We propose a novel Unified and Representation Learning for Incomplete Multi-View Clustering (URRL-IMVC) URRL-IMVC directly learns a unified embedding that is robust to view missing conditions by integrating information from multiple views and neighboring samples. We extensively evaluate the proposed URRL-IMVC framework on various benchmark datasets, demonstrating its state-of-the-art performance.
  arXiv  Detail & Related papers  (2024-07-12T09:35:25Z)
• CDIMC-net: Cognitive Deep Incomplete Multi-view Clustering Network [53.72046586512026]
  We propose a novel incomplete multi-view clustering network, called Cognitive Deep Incomplete Multi-view Clustering Network (CDIMC-net) It captures the high-level features and local structure of each view by incorporating the view-specific deep encoders and graph embedding strategy into a framework. Based on the human cognition, i.e., learning from easy to hard, it introduces a self-paced strategy to select the most confident samples for model training.
  arXiv  Detail & Related papers  (2024-03-28T15:45:03Z)
• DealMVC: Dual Contrastive Calibration for Multi-view Clustering [78.54355167448614]
  We propose a novel Dual contrastive calibration network for Multi-View Clustering (DealMVC) We first design a fusion mechanism to obtain a global cross-view feature. Then, a global contrastive calibration loss is proposed by aligning the view feature similarity graph and the high-confidence pseudo-label graph. During the training procedure, the interacted cross-view feature is jointly optimized at both local and global levels.
  arXiv  Detail & Related papers  (2023-08-17T14:14:28Z)
• Cross-view Graph Contrastive Representation Learning on Partially Aligned Multi-view Data [52.491074276133325]
  Multi-view representation learning has developed rapidly over the past decades and has been applied in many fields. We propose a new cross-view graph contrastive learning framework, which integrates multi-view information to align data and learn latent representations. Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method on the clustering and classification tasks.
  arXiv  Detail & Related papers  (2022-11-08T09:19:32Z)
• ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering [52.491074276133325]
  We propose an augmentation-free graph contrastive learning framework to solve the problem of partial multi-view clustering. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering.
  arXiv  Detail & Related papers  (2022-03-01T02:32:25Z)
• Generative Partial Multi-View Clustering [133.36721417531734]
  We propose a generative partial multi-view clustering model, named as GP-MVC, to address the incomplete multi-view problem. First, multi-view encoder networks are trained to learn common low-dimensional representations, followed by a clustering layer to capture the consistent cluster structure across multiple views. Second, view-specific generative adversarial networks are developed to generate the missing data of one view conditioning on the shared representation given by other views.
  arXiv  Detail & Related papers  (2020-03-29T17:48:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.