VLDB 2026 Research / reviewers in the wild / expert
Xichan Nie
dblp:261/8155
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0001-9448-3346ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Graph learning · 70% Trustworthy machine learning · 30% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network › node classification
few-shot node classification |
0.8 | 1 | 2024 | SMUG: Sand Mixing for Unobserved Class Detection in Graph Few-Shot Learning · WWW 2024 |
Machine learning › Graph learning › graph neural network › graph neural network generalization
graph few-shot learning |
0.8 | 1 | 2024 | SMUG: Sand Mixing for Unobserved Class Detection in Graph Few-Shot Learning · WWW 2024 |
Machine learning › Graph learning › graph neural network
node classification |
0.8 | 1 | 2024 | SMUG: Sand Mixing for Unobserved Class Detection in Graph Few-Shot Learning · WWW 2024 |
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection |
0.8 | 1 | 2024 | SMUG: Sand Mixing for Unobserved Class Detection in Graph Few-Shot Learning · WWW 2024 |
Methods — techniques the papers use, named apart from their topics
sand mixing · 0.8meta-learning · 0.8contrastive learning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | SMUG: Sand Mixing for Unobserved Class Detection in Graph Few-Shot LearningabstractGraph few-shot learning (GFSL) has achieved great success in node classification tasks with rare labels. However, graph few-shot classification (GFSC) models often encounter the problem of classifying test samples with unobserved (or unknown) classes due to the rareness of labels. We formulate this problem as out-of-distribution (OOD) sample detection in inductive graph few-shot learning. This paper presents SMUG, a novel GFSL framework that can detect unobserved classes. Since we have no ground-truth OOD samples in a practical training dataset, it is challenging for the GFSC model to retrieve knowledge about unknown classes from labeled samples. To address this difficulty, we propose a sand mixing scheme to introduce observed classes as artificial OOD samples into meta-tasks. We also develop two unsupervised OOD discriminators to identify OOD samples. Thus, we can assess the performance of OOD discriminators since we know the true classes of these artificial OOD samples. Subsequently, we design a novel training procedure to optimize the encoder based on the performance of the OOD discriminators and the GFSC model. It not only enables the GFSL model to distinguish OOD samples but also promotes the classification accuracy of normal samples. We conduct extensive experiments to evaluate the effectiveness of SMUG based on four benchmark datasets. Experimental results demonstrate that SMUG achieves superior performance over state-of-the-art approaches in OOD detection and node classification. The source code of this paper is available at https://github.com/Memepp/SMUG. Chenxu Wang 0001, Xichan Nie, Pinghui Wang, Junzhou Zhao, Xiaohong Guan |
WWW | 2 |