mlsanityData to 14 Oct 2026

Self-supervised Guided Hypergraph Feature Propagation for Semi-supervised Classification with Missing Node Features

arXiv 2302.08250 ↗First posted 16 Feb 2023cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Graph neural networks (GNNs) with missing node features have recently received increasing interest. Such missing node features seriously hurt the performance of the existing GNNs. Some recent methods have been proposed to reconstruct the missing node features by the information propagation among nodes with known and unknown attributes. Although these methods have achieved superior performance, how to exactly exploit the complex data correlations among nodes to reconstruct missing node features is still a great challenge. To solve the above problem, we propose a self-supervised guided hypergraph feature propagation (SGHFP). Specifically, the feature hypergraph is first generated according to the node features with missing information. And then, the reconstructed node features produced by the previous iteration are fed to a two-layer GNNs to construct a pseudo-label hypergraph. Before each iteration, the constructed feature hypergraph and pseudo-label hypergraph are fused effectively, which can better preserve the higher-order data correlations among nodes. After then, we apply the fused hypergraph to the feature propagation for reconstructing missing features. Finally, the reconstructed node features by multi-iteration optimization are applied to the downstream semi-supervised classification task. Extensive experiments demonstrate that the proposed SGHFP outperforms the existing semi-supervised classification with missing node feature methods.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 11 of its 23 references that are in the map. First posted on arXiv 16 Feb 2023.

Builds on

11 of 23 references.

References · 11

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2020Benchmarking Graph Neural Networkscited by 680
  4. 2018GAIN: Missing Data Imputation using Generative Adversarial Netscited by 352
  5. 20213D Infomax improves GNNs for Molecular Property Predictioncited by 146
  6. 2020Unifying Graph Convolutional Neural Networks and Label Propagationcited by 98
  7. 2021On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Featurescited by 63
  8. 2020Graph Convolutional Networks for Graphs Containing Missing Featurescited by 47
  9. 2020Learning on Attribute-Missing Graphscited by 42
  10. 2020Incomplete Graph Representation and Learning via Partial Graph Neural Networkscited by 16
  11. 2021Label Propagation across Graphs: Node Classification using Graph Neural Tangent Kernelscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.

3 papers.