paper-with-me

홈 › Papers

Open-World Semi-Supervised Learning for Node Classification

2024-03-18 · Yanling Wang, Jing Zhang, Lingxi Zhang, Lixin Liu, Yuxiao Dong, Cuiping Li, Hong Chen, Hongzhi Yin

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.

📄 PDF Abstract BibTeX arXiv:2403.11483

Code (1)

ruckbreasoning/openima 공식 구현 pytorch

Tasks

ClassificationContrastive LearningNode ClassificationOpen-World Semi-Supervised Learning

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음

Similar Papers 제목 키워드 기반

POWN: Prototypical Open-World Node Classification

2024-06-14 · Marcel Hoffmann, Lukas Galke, Ansgar Scherp

We consider the problem of \textit{true} 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 dete…

ClassificationData AugmentationNode ClassificationSelf-Supervised Learning

GraFN: Semi-Supervised Node Classification on Graph with Few Labels via Non-Parametric Distribution Assignment

2022-04-04 · Junseok Lee, Yunhak Oh, Yeonjun In, Namkyeong Lee 외

Despite the success of Graph Neural Networks (GNNs) on various applications, GNNs encounter significant performance degradation when the amount of supervision signals, i.e., number of labeled nodes, is limited, which is …

Node ClassificationSelf-Supervised Learning

FUSE: Fast Semi-Supervised Node Embedding Learning via Structural and Label-Aware Optimization

2025-10-13 · Sujan Chakraborty, Rahul Bordoloi, Anindya Sengupta, Olaf Wolkenhauer 외 arxiv

Graph-based learning is a cornerstone for analyzing structured data, with node classification as a central task. However, in many real-world graphs, nodes lack informative feature vectors, leaving only neighborhood conne…

Node Classification

Semi-supervised Domain Adaptation on Graphs with Contrastive Learning and Minimax Entropy

2023-09-14 · Jiaren Xiao, Quanyu Dai, Xiao Shen, Xiaochen Xie 외

Label scarcity in a graph is frequently encountered in real-world applications due to the high cost of data labeling. To this end, semi-supervised domain adaptation (SSDA) on graphs aims to leverage the knowledge of a la…

Contrastive LearningDomain AdaptationNode ClassificationSemi-supervised Domain Adaptation

Unsupervised Neighborhood Propagation Kernel Layers for Semi-supervised Node Classification

2023-01-31 · Sonny Achten, Francesco Tonin, Panagiotis Patrinos, Johan A. K. Suykens

We present a deep Graph Convolutional Kernel Machine (GCKM) for semi-supervised node classification in graphs. The method is built of two main types of blocks: (i) We introduce unsupervised kernel machine layers propagat…

ClassificationNode Classification