Variational Graph Autoencoder for Heterogeneous Information Networks with Missing and Inaccurate Attributes
Abstract
Heterogeneous Information Networks (HINs), which consist of various types of nodes and edges, have recently witnessed excellent performance in graph mining. However, most existing heterogeneous graph neural networks (HGNNs) fail to simultaneously handle the problems of missing attributes, inaccurate attributes and scarce node labels, which limits their expressiveness. In this paper, we propose a generative self-supervised model GraMI\ to address these issues simultaneously. Specifically, GraMI\ first initializes all the nodes in the graph with a low-dimensional representation matrix. After that, based on the variational graph autoencoder framework, GraMI\ learns both node-level and attribute-level embeddings in the encoder, which can provide fine-grained semantic information to construct node attributes. In the decoder, GraMI\ reconstructs both links and attributes. Instead of directly reconstructing raw features for attributed nodes, GraMI\ generates the initial low-dimensional representation matrix for all the nodes, based on which raw features of attributed nodes are further reconstructed. In this way, GraMI\ can not only complete informative features for non-attributed nodes, but rectify inaccurate ones for attributed nodes. Finally, we conduct extensive experiments to show the superiority of GraMI\ in tackling HINs with missing and inaccurate attributes. Our code and data can be found here:.
Benchmark Results
Tested on 1 dataset 5 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterogeneous Graph Benchmarks
| # | Model | Micro-F1 ↑ | Paper |
|---|---|---|---|
| 1 | LMSPS | 0.9566
±0.0020 | |
| 2 | PSHGCN | 0.9561
±0.0012 | |
| 3 | RpHGNN | 0.9555
±0.0029 | |
| 10 | GraMI | 0.9503 | This paper |
| 21 | GCN | 0.9460
±0.0031 | |
| 22 | MAGNN | 0.9456 best reported | |
| 23 | GAT | 0.9448
±0.0022 best reported | best at pub: Graph Neural Networks with a Distribution of Parametrized Graphs (ICML 2023) |
| 29 | HGCA | 0.9434 | This paper |
| 37 | HAN | 0.9369 | prev best: Heterogeneous Graph Contrastive Multi-view Learning (2022) Improvement within reported uncertainty; not highlighted. |
| 41 | HGMAE | 0.9340
±0.0060 best reported | best at pub: HetGPT: Harnessing the Power of Prompt Tuning in Pre-Trained Heterogeneous Graph Neural Networks (WWW 2023) best today: Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective (NeurIPS 2024) |
| 44 | DMGI | 0.9331 | prev best: Heterogeneous Graph Contrastive Multi-view Learning (2022) |
| 47 | Mp2vec | 0.9304 best reported | |
| 79 | DGI | 0.9016
±0.0060 best reported | best at pub: Heterogeneous Graph Contrastive Multi-view Learning (2022) |
| 93 | SEEGERA | 0.8664 | This paper |
| 176 | MLP | 0.6447
±0.0136 |
