NC-NCD: Novel Class Discovery for Node Classification
Not on the map. Why?
Abstract (arXiv)
Novel Class Discovery (NCD) involves identifying new categories within unlabeled data by utilizing knowledge acquired from previously established categories. However, existing NCD methods often struggle to maintain a balance between the performance of old and new categories. Discovering unlabeled new categories in a class-incremental way is more practical but also more challenging, as it is frequently hindered by either catastrophic forgetting of old categories or an inability to learn new ones. Furthermore, the implementation of NCD on continuously scalable graph-structured data remains an under-explored area. In response to these challenges, we introduce for the first time a more practical NCD scenario for node classification (i.e., NC-NCD), and propose a novel self-training framework with prototype replay and distillation called SWORD, adopted to our NC-NCD setting. Our approach enables the model to cluster unlabeled new category nodes after learning labeled nodes while preserving performance on old categories without reliance on old category nodes. SWORD achieves this by employing a self-training strategy to learn new categories and preventing the forgetting of old categories through the joint use of feature prototypes and knowledge distillation. Extensive experiments on four common benchmarks demonstrate the superiority of SWORD over other state-of-the-art methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 36 of its 63 references that are in the map. First posted on arXiv 25 Jul 2024.
Builds on
36 of 63 references.
References · 36
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2018Experience Replay for Continual Learningcited by 1,074
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
24 more
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 461
- 2019On Tiny Episodic Memories in Continual Learningcited by 299
- 2021Identity-aware Graph Neural Networkscited by 197
- 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
- 2021A Unified Objective for Novel Class Discoverycited by 161
- 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 141
- 2017Learning to cluster in order to transfer across domains and taskscited by 128
- 2020AM-GCN: Adaptive Multi-channel Graph Convolutional Networkscited by 121
- 2019Continuous Graph Neural Networkscited by 114
- 2019Multi-class Classification without Multi-class Labelscited by 100
- 2020OpenMix: Reviving Known Knowledge for Discovering Novel Visual Categories in An Open Worldcited by 93
- 2020Overcoming Catastrophic Forgetting in Graph Neural Networkscited by 93
- 2019Spherical Kernel for Efficient Graph Convolution on 3D Point Cloudscited by 57
- 2020Topology-Aware Graph Pooling Networkscited by 44
- 2020GraphSAIL: Graph Structure Aware Incremental Learning for Recommender Systemscited by 42
- 2021Graph Few-shot Class-incremental Learningcited by 40
- 2021Continual Learning of Knowledge Graph Embeddingscited by 35
- 2024Do LLMs Understand Visual Anomalies? Uncovering LLM's Capabilities in Zero-shot Anomaly Detectioncited by 35
- 2020Disentangle-based Continual Graph Representation Learningcited by 25
- 2023HiTIN: Hierarchy-aware Tree Isomorphism Network for Hierarchical Text Classificationcited by 17
- 2021Zero-shot Node Classification with Decomposed Graph Prototype Networkcited by 15
- 2022A Simple yet Effective Method for Graph Classificationcited by 14
- 2024HILL: Hierarchy-aware Information Lossless Contrastive Learning for Hierarchical Text Classificationcited by 13
- 2020Open-World Class Discovery with Kernel Networkscited by 12
Built on by
Citing papers per year: 2025: 4.
4 papers.
- 2025Category Discovery: An Open-World Perspectivecited by 5
- 2025Structural Entropy Guided Unsupervised Graph Out-Of-Distribution Detectioncited by 3
- 2025Intra-view and Inter-view Correlation Guided Multi-view Novel Class Discoverycited by 0
- 2025Toward Robust Signed Graph Learning through Joint Input-Target Denoisingcited by 0
- 2025Toward Robust Signed Graph Learning through Joint Input-Target Denoising26 Oct 2025
- 2025Category Discovery: An Open-World Perspective26 Sep 2025
- 2025Intra-view and Inter-view Correlation Guided Multi-view Novel Class Discovery16 Jul 2025
- 2025Structural Entropy Guided Unsupervised Graph Out-Of-Distribution Detection5 Mar 2025