mlsanityData to 7 Oct 2026

Divide-Then-Rule: A Cluster-Driven Hierarchical Interpolator for Attribute-Missing Graphs

arXiv 2507.10595 ↗First posted 12 Jul 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Deep graph clustering (DGC) for attribute-missing graphs is an unsupervised task aimed at partitioning nodes with incomplete attributes into distinct clusters. Addressing this challenging issue is vital for practical applications. However, research in this area remains underexplored. Existing imputation methods for attribute-missing graphs often fail to account for the varying amounts of information available across node neighborhoods, leading to unreliable results, especially for nodes with insufficient known neighborhood. To address this issue, we propose a novel method named Divide-Then-Rule Graph Completion (DTRGC). This method first addresses nodes with sufficient known neighborhood information and treats the imputed results as new knowledge to iteratively impute more challenging nodes, while leveraging clustering information to correct imputation errors. Specifically, Dynamic Cluster-Aware Feature Propagation (DCFP) initializes missing node attributes by adjusting propagation weights based on the clustering structure. Subsequently, Hierarchical Neighborhood-aware Imputation (HNAI) categorizes attribute-missing nodes into three groups based on the completeness of their neighborhood attributes. The imputation is performed hierarchically, prioritizing the groups with nodes that have the most available neighborhood information. The cluster structure is then used to refine the imputation and correct potential errors. Finally, Hop-wise Representation Enhancement (HRE) integrates information across multiple hops, thereby enriching the expressiveness of node representations. Experimental results on six widely used graph datasets show that DTRGC significantly improves the clustering performance of various DGC methods under attribute-missing graphs.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 35 of its 72 references that are in the map. First posted on arXiv 12 Jul 2025.

Builds on

35 of 72 references.

References · 35

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2021Deep Graph Clustering via Dual Correlation Reductioncited by 97
  3. 2024Merging Multi-Task Models via Weight-Ensembling Mixture of Expertscited by 85
  4. 2019Learning Graph Embedding with Adversarial Training Methodscited by 84
  5. 2022How would Stance Detection Techniques Evolve after the Launch of ChatGPT?cited by 76
  6. 2020Deep Fusion Clustering Networkcited by 71
  7. 2021On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Featurescited by 62
  8. 2022Hard Sample Aware Network for Contrastive Deep Graph Clusteringcited by 61
  9. 2023Cluster-guided Contrastive Graph Clustering Networkcited by 60
  10. 2024A Survey of Graph Neural Networks in Real world: Imbalance, Noise, Privacy and OOD Challengescited by 54
  11. 2023Deep Imbalanced Learning for Multimodal Emotion Recognition in Conversationscited by 47
  12. 2020Graph Convolutional Networks for Graphs Containing Missing Featurescited by 46
23 more
  1. 2023CoCo: A Coupled Contrastive Framework for Unsupervised Domain Adaptive Graph Classificationcited by 46
  2. 2020Learning on Attribute-Missing Graphscited by 42
  3. 2021Attention-driven Graph Clustering Networkcited by 40
  4. 2023Dink-Net: Neural Clustering on Large Graphscited by 38
  5. 2021Rethinking Graph Auto-Encoder Models for Attributed Graph Clusteringcited by 37
  6. 2022T2-GNN: Graph Neural Networks for Graphs with Incomplete Features and Structure via Teacher-Student Distillationcited by 32
  7. 2022A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resourcecited by 26
  8. 2023CONVERT:Contrastive Graph Clustering with Reliable Augmentationcited by 23
  9. 2023DER-GCN: Dialogue and Event Relation-Aware Graph Convolutional Neural Network for Multimodal Dialogue Emotion Recognitioncited by 23
  10. 2022CGC: Contrastive Graph Clustering for Community Detection and Trackingcited by 21
  11. 2023Fast Continual Multi-View Clustering with Incomplete Viewscited by 19
  12. 2021Self-supervised Contrastive Attributed Graph Clusteringcited by 18
  13. 2020Incomplete Graph Representation and Learning via Partial Graph Neural Networkscited by 16
  14. 2022Ada-NETS: Face Clustering via Adaptive Neighbour Discovery in the Structure Spacecited by 16
  15. 2024Dual Test-time Training for Out-of-distribution Recommender Systemcited by 16
  16. 2024SA-GDA: Spectral Augmentation for Graph Domain Adaptationcited by 16
  17. 2023Confidence-Based Feature Imputation for Graphs with Partially Known Featurescited by 13
  18. 2022Accurate Node Feature Estimation with Structured Variational Graph Autoencodercited by 12
  19. 2024DaRec: A Disentangled Alignment Framework for Large Language Model and Recommender Systemcited by 11
  20. 2022GraphLearner: Graph Node Clustering with Fully Learnable Augmentationcited by 10
  21. 2025Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learningcited by 7
  22. 2021RepBin: Constraint-based Graph Representation Learning for Metagenomic Binningcited by 5
  23. 2024Identify Then Recommend: Towards Unsupervised Group Recommendationcited by 3

Built on by

Not cited yet.