mlsanityData to 7 Oct 2026

Dual Information Enhanced Multi-view Attributed Graph Clustering

arXiv 2211.14987 ↗First posted 28 Nov 2022cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Multi-view attributed graph clustering is an important approach to partition multi-view data based on the attribute feature and adjacent matrices from different views. Some attempts have been made in utilizing Graph Neural Network (GNN), which have achieved promising clustering performance. Despite this, few of them pay attention to the inherent specific information embedded in multiple views. Meanwhile, they are incapable of recovering the latent high-level representation from the low-level ones, greatly limiting the downstream clustering performance. To fill these gaps, a novel Dual Information enhanced multi-view Attributed Graph Clustering (DIAGC) method is proposed in this paper. Specifically, the proposed method introduces the Specific Information Reconstruction (SIR) module to disentangle the explorations of the consensus and specific information from multiple views, which enables GCN to capture the more essential low-level representations. Besides, the Mutual Information Maximization (MIM) module maximizes the agreement between the latent high-level representation and low-level ones, and enables the high-level representation to satisfy the desired clustering structure with the help of the Self-supervised Clustering (SC) module. Extensive experiments on several real-world benchmarks demonstrate the effectiveness of the proposed DIAGC method compared with the state-of-the-art baselines.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 19 of its 93 references that are in the map. First posted on arXiv 28 Nov 2022.

Builds on

19 of 93 references.

References · 19

  1. 2016Variational Graph Auto-Encoderscited by 1,373
  2. 2018Deep Graph Infomaxcited by 1,101
  3. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
  4. 2015LINE: Large-scale Information Network Embeddingcited by 582
  5. 2020Data Augmentation for Graph Neural Networkscited by 200
  6. 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
  7. 2020Graph Information Bottleneckcited by 168
  8. 2019Attributed Graph Clustering: A Deep Attentional Embedding Approachcited by 149
  9. 2020Structural Deep Clustering Networkcited by 145
  10. 2020Graph Information Bottleneck for Subgraph Recognitioncited by 119
  11. 2021Multi-view Contrastive Graph Clusteringcited by 76
  12. 2018Essential Tensor Learning for Multi-view Spectral Clusteringcited by 31
7 more
  1. 2016On Unifying Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimizationcited by 25
  2. 2017Principled Multilayer Network Embeddingcited by 24
  3. 2020Multi-view Graph Learning by Joint Modeling of Consistency and Inconsistencycited by 18
  4. 2021Consistent Multiple Graph Embedding for Multi-View Clusteringcited by 12
  5. 2019Multi-view Subspace Clustering via Partition Fusioncited by 8
  6. 2021Multilayer Graph Contrastive Clustering Networkcited by 8
  7. 2022High-order Multi-view Clustering for Generic Datacited by 8

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.