Open-World Semi-Supervised Learning for Node Classification
Not on the map. Why?
Abstract (arXiv)
Open-world semi-supervised learning (Open-world SSL) for node classification, that classifies unlabeled nodes into seen classes or multiple novel classes, is a practical but under-explored problem in the graph community. As only seen classes have human labels, they are usually better learned than novel classes, and thus exhibit smaller intra-class variances within the embedding space (named as imbalance of intra-class variances between seen and novel classes). Based on empirical and theoretical analysis, we find the variance imbalance can negatively impact the model performance. Pre-trained feature encoders can alleviate this issue via producing compact representations for novel classes. However, creating general pre-trained encoders for various types of graph data has been proven to be challenging. As such, there is a demand for an effective method that does not rely on pre-trained graph encoders. In this paper, we propose an IMbalance-Aware method named OpenIMA for Open-world semi-supervised node classification, which trains the node classification model from scratch via contrastive learning with bias-reduced pseudo labels. Extensive experiments on seven popular graph benchmarks demonstrate the effectiveness of OpenIMA, and the source code has been available on GitHub.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 45 of its 70 references that are in the map. First posted on arXiv 18 Mar 2024.
Builds on
45 of 70 references.
References · 45
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
- 2020Supervised Contrastive Learningcited by 2,829
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
33 more
- 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 640
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 463
- 2018Recent Advances in Open Set Recognition: A Surveycited by 310
- 2017Zero-Shot Learning -- The Good, the Bad and the Uglycited by 255
- 2022Generalized Category Discoverycited by 211
- 2023GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networkscited by 167
- 2021Open-World Semi-Supervised Learningcited by 165
- 2023All in One: Multi-task Prompting for Graph Neural Networkscited by 148
- 2016An Empirical Study and Analysis of Generalized Zero-Shot Learning for Object Recognition in the Wildcited by 146
- 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 143
- 2017Learning to cluster in order to transfer across domains and taskscited by 128
- 2022How to Exploit Hyperspherical Embeddings for Out-of-Distribution Detection?cited by 128
- 2022Parametric Classification for Generalized Category Discovery: A Baseline Studycited by 113
- 2019Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labelscited by 111
- 2020Conditional Gaussian Distribution Learning for Open Set Recognitioncited by 104
- 2020OpenMix: Reviving Known Knowledge for Discovering Novel Visual Categories in An Open Worldcited by 93
- 2022PromptCAL: Contrastive Affinity Learning via Auxiliary Prompts for Generalized Novel Category Discoverycited by 87
- 2023Learning Semi-supervised Gaussian Mixture Models for Generalized Category Discoverycited by 72
- 2018GeniePath: Graph Neural Networks with Adaptive Receptive Pathscited by 66
- 2022Class-Aware Contrastive Semi-Supervised Learningcited by 62
- 2021ImGAGN:Imbalanced Network Embedding via Generative Adversarial Graph Networkscited by 51
- 2021OpenMatch: Open-set Consistency Regularization for Semi-supervised Learning with Outlierscited by 43
- 2021MiCE: Mixture of Contrastive Experts for Unsupervised Image Clusteringcited by 42
- 2022OpenLDN: Learning to Discover Novel Classes for Open-World Semi-Supervised Learningcited by 37
- 2022OpenCon: Open-world Contrastive Learningcited by 33
- 2023Learning on Graphs with Out-of-Distribution Nodescited by 29
- 2023Contrastive Pseudo Learning for Open-World DeepFake Attributioncited by 27
- 2021Semi-supervised Contrastive Learning with Similarity Co-calibrationcited by 26
- 2020Clustering based Contrastive Learning for Improving Face Representationscited by 21
- 2021Lifelong Learning on Evolving Graphs Under the Constraints of Imbalanced Classes and New Classescited by 11
- 2023Imbalanced Node Classification Beyond Homophilic Assumptioncited by 7
- 2023G2Pxy: Generative Open-Set Node Classification on Graphs with Proxy Unknownscited by 5
- 2023Zero-Knowledge Zero-Shot Learning for Novel Visual Category Discoverycited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.