AmGCL: Feature Imputation of Attribute Missing Graph via Self-supervised Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
Attribute graphs are ubiquitous in multimedia applications, and graph representation learning (GRL) has been successful in analyzing attribute graph data. However, incomplete graph data and missing node attributes can have a negative impact on media knowledge discovery. Existing methods for handling attribute missing graph have limited assumptions or fail to capture complex attribute-graph dependencies. To address these challenges, we propose Attribute missing Graph Contrastive Learning (AmGCL), a framework for handling missing node attributes in attribute graph data. AmGCL leverages Dirichlet energy minimization-based feature precoding to encode in missing attributes and a self-supervised Graph Augmentation Contrastive Learning Structure (GACLS) to learn latent variables from the encoded-in data. Specifically, AmGCL utilizies feature reconstruction based on structure-attribute energy minimization while maximizes the lower bound of evidence for latent representation mutual information. Our experimental results on multiple real-world datasets demonstrate that AmGCL outperforms state-of-the-art methods in both feature imputation and node classification tasks, indicating the effectiveness of our proposed method in real-world attribute graph analysis tasks.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 19 of its 41 references that are in the map. First posted on arXiv 5 May 2023.
Builds on
19 of 41 references.
References · 19
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2018Link Prediction Based on Graph Neural Networkscited by 832
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2018GAIN: Missing Data Imputation using Generative Adversarial Netscited by 352
- 2020Handling Missing Data with Graph Representation Learningcited by 133
- 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
7 more
- 2021On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Featurescited by 63
- 2019Missing Data Imputation with Adversarially-trained Graph Convolutional Networkscited by 54
- 2020Graph Convolutional Networks for Graphs Containing Missing Featurescited by 47
- 2020Learning on Attribute-Missing Graphscited by 42
- 2019Combining Generative and Discriminative Models for Hybrid Inferencecited by 34
- 2022Accurate Node Feature Estimation with Structured Variational Graph Autoencodercited by 12
- 2020A^2-GCN: An Attribute-aware Attentive GCN Model for Recommendationcited by 3
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 1.
4 papers.
- 2024RIDA: A Robust Attack Framework on Incomplete Graphscited by 1
- 2024MDS-GNN: A Mutual Dual-Stream Graph Neural Network on Graphs with Incomplete Features and Structurecited by 1
- 2025Topology-Driven Attribute Recovery for Attribute Missing Graph Learning in Social Internet of Thingscited by 0
- 2026FSD-CAP: Fractional Subgraph Diffusion with Class-Aware Propagation for Graph Feature Imputationcited by 0
- 2026FSD-CAP: Fractional Subgraph Diffusion with Class-Aware Propagation for Graph Feature Imputation26 Jan 2026
- 2025Topology-Driven Attribute Recovery for Attribute Missing Graph Learning in Social Internet of Things17 Jan 2025
- 2024MDS-GNN: A Mutual Dual-Stream Graph Neural Network on Graphs with Incomplete Features and Structure9 Aug 2024
- 2024RIDA: A Robust Attack Framework on Incomplete Graphs25 Jul 2024