MCFCN: Multi-View Clustering via a Fusion-Consensus Graph Convolutional Network

• URL: http://arxiv.org/abs/2511.05554v1
• Date: Mon, 03 Nov 2025 14:46:04 GMT
• Title: MCFCN: Multi-View Clustering via a Fusion-Consensus Graph Convolutional Network
• Authors: Chenping Pei, Fadi Dornaika, Jingjun Bi,
• Abstract summary: A Fusion-Consensus Graph Convolutional Network (MCFCN) is proposed to improve Multi-View Clustering.<n>It learns the consensus graph of multi-view data in an end-to-end manner and learns effective consensus representations.<n>MCFCN demonstrates state-of-the-art performance on eight multi-view benchmark datasets.
• Score: 9.300953069946969
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Existing Multi-view Clustering (MVC) methods based on subspace learning focus on consensus representation learning while neglecting the inherent topological structure of data. Despite the integration of Graph Neural Networks (GNNs) into MVC, their input graph structures remain susceptible to noise interference. Methods based on Multi-view Graph Refinement (MGRC) also have limitations such as insufficient consideration of cross-view consistency, difficulty in handling hard-to-distinguish samples in the feature space, and disjointed optimization processes caused by graph construction algorithms. To address these issues, a Multi-View Clustering method via a Fusion-Consensus Graph Convolutional Network (MCFCN) is proposed. The network learns the consensus graph of multi-view data in an end-to-end manner and learns effective consensus representations through a view feature fusion model and a Unified Graph Structure Adapter (UGA). It designs Similarity Matrix Alignment Loss (SMAL) and Feature Representation Alignment Loss (FRAL). With the guidance of consensus, it optimizes view-specific graphs, preserves cross-view topological consistency, promotes the construction of intra-class edges, and realizes effective consensus representation learning with the help of GCN to improve clustering performance. MCFCN demonstrates state-of-the-art performance on eight multi-view benchmark datasets, and its effectiveness is verified by extensive qualitative and quantitative implementations. The code will be provided at https://github.com/texttao/MCFCN.

Related papers

• Global Graph Propagation with Hierarchical Information Transfer for Incomplete Contrastive Multi-view Clustering [12.080981190754986]
  We propose a novel incomplete multi-view clustering method with hierarchical information transfer.<n>Our method combines view-specific representation learning, global graph propagation with hierarchical information transfer, and contrastive clustering for joint optimization.
  arXiv  Detail & Related papers  (2025-02-26T16:50:08Z)
• 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)
• Scalable Incomplete Multi-View Clustering with Structure Alignment [71.62781659121092]
  In this paper, we propose a novel incomplete anchor graph learning framework. We construct the view-specific anchor graph to capture the complementary information from different views. The time and space complexity of the proposed SIMVC-SA is proven to be linearly correlated with the number of samples.
  arXiv  Detail & Related papers  (2023-08-31T08:30:26Z)
• 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)
• A Clustering-guided Contrastive Fusion for Multi-view Representation Learning [7.630965478083513]
  We propose a deep fusion network to fuse view-specific representations into the view-common representation. We also design an asymmetrical contrastive strategy that aligns the view-common representation and each view-specific representation. In the incomplete view scenario, our proposed method resists noise interference better than those of our competitors.
  arXiv  Detail & Related papers  (2022-12-28T07:21:05Z)
• Multi-view Graph Convolutional Networks with Differentiable Node Selection [29.575611350389444]
  We propose a framework dubbed Multi-view Graph Convolutional Network with Differentiable Node Selection (MGCN-DNS) MGCN-DNS accepts multi-channel graph-structural data as inputs and aims to learn more robust graph fusion through a differentiable neural network. The effectiveness of the proposed method is verified by rigorous comparisons with considerable state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-12-09T21:48:36Z)
• GraphLearner: Graph Node Clustering with Fully Learnable Augmentation [76.63963385662426]
  Contrastive deep graph clustering (CDGC) leverages the power of contrastive learning to group nodes into different clusters. We propose a Graph Node Clustering with Fully Learnable Augmentation, termed GraphLearner. It introduces learnable augmentors to generate high-quality and task-specific augmented samples for CDGC.
  arXiv  Detail & Related papers  (2022-12-07T10:19:39Z)
• 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)
• Attention-driven Graph Clustering Network [49.040136530379094]
  We propose a novel deep clustering method named Attention-driven Graph Clustering Network (AGCN) AGCN exploits a heterogeneous-wise fusion module to dynamically fuse the node attribute feature and the topological graph feature. AGCN can jointly perform feature learning and cluster assignment in an unsupervised fashion.
  arXiv  Detail & Related papers  (2021-08-12T02:30:38Z)
• Multi-Level Graph Convolutional Network with Automatic Graph Learning for Hyperspectral Image Classification [63.56018768401328]
  We propose a Multi-level Graph Convolutional Network (GCN) with Automatic Graph Learning method (MGCN-AGL) for HSI classification. By employing attention mechanism to characterize the importance among spatially neighboring regions, the most relevant information can be adaptively incorporated to make decisions. Our MGCN-AGL encodes the long range dependencies among image regions based on the expressive representations that have been produced at local level.
  arXiv  Detail & Related papers  (2020-09-19T09:26:20Z)

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.