DAS-PMVC: A Framework for Partial Multi-View Clustering via Dual Alignment and Structure Enhancement

• URL: http://arxiv.org/abs/2607.27761v1
• Date: Thu, 30 Jul 2026 07:01:35 GMT
• Title: DAS-PMVC: A Framework for Partial Multi-View Clustering via Dual Alignment and Structure Enhancement
• Abstract summary: This paper proposes a framework for partial multi-view clustering via dual alignment and structure enhancement (DAS-PMVC)<n>DAS-PMVC includes three parts: textbfanchor graph structure alignment, textbfstructure-enhanced feature learning, and textbfa dual alignment strategy<n> Experimental results on various datasets demonstrate that the DAS-PMVC framework outperforms existing state-of-the-art methods in clustering performance.
• Score: 13.05750989297313
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In recent years, multi-view clustering has attracted widespread research interest. However, due to limitations in data collection devices, data across different views often suffer from misalignment, leading to the partial view alignment problem (PVAP). To mitigate the impact of view asymmetry and irrelevant samples, this paper proposes a framework for partial multi-view clustering via dual alignment and structure enhancement (DAS-PMVC), which leverages view structure consistency and semantic relevance. Specifically, DAS-PMVC includes three parts: \textbf{anchor graph structure alignment}, where sample joint embedding representations with consistent latent space are derived from anchor point relationships for initial view alignment; \textbf{structure-enhanced feature learning}, where the model learns view structure information through pretraining and combines multi-view graph convolutional networks to further extract deep latent features from the aligned graph structure to improve the discriminative power of representations; and \textbf{a dual alignment strategy}, where initial alignment is performed through the anchor graph in the pretraining phase, and contrastive learning loss and the Hungarian algorithm are introduced in the training phase to further optimize the alignment of latent features. Experimental results on various datasets demonstrate that the DAS-PMVC framework outperforms existing state-of-the-art methods in clustering performance, showcasing its effectiveness and superiority.

Related papers

• SPORT: Structure-Aware Prototype Disentanglement for Incomplete Multi-View Clustering [51.01038967474103]
  Prototype-based Incomplete Multi-view Clustering has attracted increasing attention by exploiting prototypes as semantic anchors for missing-view imputation.<n>We propose a novel framework termed Structure-aware PrOtotype disentanglement foR incomplete multi-view clusTering (SPORT)<n>SPORT explicitly disentangles shared and view-specific components of prototypes while preserving cluster-level relational structures.
  arXiv  Detail & Related papers  (2026-07-11T17:40:22Z)
• Incomplete Multi-view Clustering via Hierarchical Semantic Alignment and Cooperative Completion [13.39263294343983]
  This paper proposes a novel incomplete multi-view clustering framework based on Hierarchical Semantic Alignment and Cooperative Completion (HSACC)<n>HSACC achieves robust cross-view fusion through a dual-level semantic space design.<n> Experimental results demonstrate that HSACC significantly outperforms state-of-the-art methods on five benchmark datasets.
  arXiv  Detail & Related papers  (2025-10-14T02:58:10Z)
• Generalized Deep Multi-view Clustering via Causal Learning with Partially Aligned Cross-view Correspondence [72.41989962665285]
  Multi-view clustering (MVC) aims to explore the common clustering structure across multiple views.<n>However, real-world scenarios often present a challenge as only partial data is consistently aligned across different views.<n>We design a causal multi-view clustering network, termed CauMVC, to tackle this problem.
  arXiv  Detail & Related papers  (2025-09-19T14:31:40Z)
• Structure-guided Deep Multi-View Clustering [13.593229506936682]
  Deep multi-view clustering seeks to utilize the abundant information from multiple views to improve clustering performance.<n>Most of the existing clustering methods often neglect to fully mine multi-view structural information.<n>We propose a structure-guided deep multi-view clustering model to explore the distribution of multi-view data.
  arXiv  Detail & Related papers  (2025-01-17T12:42:30Z)
• 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)
• SLRL: Structured Latent Representation Learning for Multi-view Clustering [24.333292079699554]
  Multi-View Clustering (MVC) aims to exploit the inherent consistency and complementarity among different views to improve clustering outcomes. Despite extensive research in MVC, most existing methods focus predominantly on harnessing complementary information across views to enhance clustering effectiveness. We introduce a novel framework, termed Structured Latent Representation Learning based Multi-View Clustering method.
  arXiv  Detail & Related papers  (2024-07-11T09:43:57Z)
• One for all: A novel Dual-space Co-training baseline for Large-scale Multi-View Clustering [42.92751228313385]
  We propose a novel multi-view clustering model, named Dual-space Co-training Large-scale Multi-view Clustering (DSCMC) The main objective of our approach is to enhance the clustering performance by leveraging co-training in two distinct spaces. Our algorithm has an approximate linear computational complexity, which guarantees its successful application on large-scale datasets.
  arXiv  Detail & Related papers  (2024-01-28T16:30:13Z)
• Efficient Multi-View Graph Clustering with Local and Global Structure Preservation [59.49018175496533]
  We propose a novel anchor-based multi-view graph clustering framework termed Efficient Multi-View Graph Clustering with Local and Global Structure Preservation (EMVGC-LG) Specifically, EMVGC-LG jointly optimize anchor construction and graph learning to enhance the clustering quality. In addition, EMVGC-LG inherits the linear complexity of existing AMVGC methods respecting the sample number.
  arXiv  Detail & Related papers  (2023-08-31T12:12:30Z)
• 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)
• Fine-grained Graph Learning for Multi-view Subspace Clustering [2.4094285826152593]
  We propose a fine-grained graph learning framework for multi-view subspace clustering (FGL-MSC) The main challenge is how to optimize the fine-grained fusion weights while generating the learned graph that fits the clustering task. Experiments on eight real-world datasets show that the proposed framework has comparable performance to the state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-01-12T18:00:29Z)
• Effective and Efficient Graph Learning for Multi-view Clustering [173.8313827799077]
  We propose an effective and efficient graph learning model for multi-view clustering. Our method exploits the view-similar between graphs of different views by the minimization of tensor Schatten p-norm. Our proposed algorithm is time-economical and obtains the stable results and scales well with the data size.
  arXiv  Detail & Related papers  (2021-08-15T13:14:28Z)
• 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.