mlsanityData to 7 Oct 2026

G2Pxy: Generative Open-Set Node Classification on Graphs with Proxy Unknowns

arXiv 2308.05463 ↗First posted 10 Aug 2023cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Node classification is the task of predicting the labels of unlabeled nodes in a graph. State-of-the-art methods based on graph neural networks achieve excellent performance when all labels are available during training. But in real-life, models are often applied on data with new classes, which can lead to massive misclassification and thus significantly degrade performance. Hence, developing open-set classification methods is crucial to determine if a given sample belongs to a known class. Existing methods for open-set node classification generally use transductive learning with part or all of the features of real unseen class nodes to help with open-set classification. In this paper, we propose a novel generative open-set node classification method, i.e. G2Pxy, which follows a stricter inductive learning setting where no information about unknown classes is available during training and validation. Two kinds of proxy unknown nodes, inter-class unknown proxies and external unknown proxies are generated via mixup to efficiently anticipate the distribution of novel classes. Using the generated proxies, a closed-set classifier can be transformed into an open-set one, by augmenting it with an extra proxy classifier. Under the constraints of both cross entropy loss and complement entropy loss, G2Pxy achieves superior effectiveness for unknown class detection and known class classification, which is validated by experiments on benchmark graph datasets. Moreover, G2Pxy does not have specific requirement on the GNN architecture and shows good generalizations.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 15 of its 27 references that are in the map. First posted on arXiv 10 Aug 2023.

Builds on

15 of 27 references.

References · 15

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2017On Calibration of Modern Neural Networkscited by 4,860
  5. 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,362
  6. 2015Towards Open Set Deep Networkscited by 533
  7. 2019GMAN: A Graph Multi-Attention Network for Traffic Predictioncited by 433
  8. 2018Why ReLU networks yield high-confidence predictions far away from the training data and how to mitigate the problemcited by 323
  9. 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 145
  10. 2021Learning Placeholders for Open-Set Recognitioncited by 121
  11. 2017DOC: Deep Open Classification of Text Documentscited by 109
  12. 2017Open-Category Classification by Adversarial Sample Generationcited by 24
3 more
  1. 2019Complement Objective Trainingcited by 15
  2. 2020Open-World Class Discovery with Kernel Networkscited by 12
  3. 2022Shift-Robust Node Classification via Graph Adversarial Clusteringcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 1; 2026: 1.

5 papers.