POWN: Prototypical Open-World Node Classification
Not on the map. Why?
Abstract (arXiv)
We consider the problem of textittrue open-world semi-supervised node classification, in which nodes in a graph either belong to known or new classes, with the latter not present during training. Existing methods detect and reject new classes but fail to distinguish between different new classes. We adapt existing methods and show they do not solve the problem sufficiently. We introduce a novel end-to-end approach for classification into known classes and new classes based on class prototypes, which we call Prototypical Open-World Learning for Node Classification (POWN). Our method combines graph semi-supervised learning, self-supervised learning, and pseudo-labeling to learn prototype representations of new classes in a zero-shot way. In contrast to existing solutions from the vision domain, POWN does not require data augmentation techniques for node classification. Experiments on benchmark datasets demonstrate the effectiveness of POWN, where it outperforms baselines by up to 20% accuracy on the small and up to 30% on the large datasets. Source code is available at https://github.com/Bobowner/POWN.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 33 of its 48 references that are in the map. First posted on arXiv 14 Jun 2024.
Builds on
33 of 48 references.
References · 33
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 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
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2016Variational Graph Auto-Encoderscited by 1,382
- 2018Deep Graph Infomaxcited by 1,106
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
- 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 640
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
21 more
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 311
- 2020GPT-GNN: Generative Pre-Training of Graph Neural Networkscited by 303
- 2021Graph Self-Supervised Learning: A Surveycited by 289
- 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 225
- 2020Graph Representation Learning via Graphical Mutual Information Maximizationcited by 217
- 2021Open-World Semi-Supervised Learningcited by 165
- 2020When Does Self-Supervision Help Graph Convolutional Networks?cited by 121
- 2017DOC: Deep Open Classification of Text Documentscited by 109
- 2019Meta-GNN: On Few-shot Node Classification in Graph Meta-learningcited by 105
- 2020Graph Prototypical Networks for Few-shot Learning on Attributed Networkscited by 90
- 2021Graph-MLP: Node Classification without Message Passing in Graphcited by 73
- 2021Open-world Machine Learning: Applications, Challenges, and Opportunitiescited by 34
- 2022OpenCon: Open-world Contrastive Learningcited by 33
- 2020Lifelong Learning of Graph Neural Networks for Open-World Node Classificationcited by 22
- 2022Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representationcited by 22
- 2020Entropic Out-of-Distribution Detection: Seamless Detection of Unknown Examplescited by 16
- 2021Lifelong Learning on Evolving Graphs Under the Constraints of Imbalanced Classes and New Classescited by 11
- 2021Learning Graph Representation by Aggregating Subgraphs via Mutual Information Maximizationcited by 5
- 2023Open-World Lifelong Graph Learningcited by 5
- 2022Open-set Recognition via Augmentation-based Similarity Learningcited by 2
- 2023The Split Matters: Flat Minima Methods for Improving the Performance of GNNscited by 2
Built on by
Not cited yet.