Few-shot Node Classification on Attributed Networks with Graph Meta-learning
Yonghao Liu, Mengyu Li, Ximing Li, Fausto Giunchiglia, Xiaoyue Feng, Renchu Guan
摘要
Attributed networks, as a manifestation of data in non-Euclidean domains, have a wide range of applications in the real world, such as molecular property prediction, social network analysis and anomaly detection. Node classification, as a fundamental research problem in attributed networks, has attracted increasing attention among research communities. However, most existing models cannot be directly applied to the data with limited labeled instances (.e., the few-shot scenario). Few-shot node classification on attributed networks is gradually becoming a research hotspot. Although several methods aim to integrate meta-learning with graph neural networks to address this problem, some limitations remain. First, they all assume node representation learning using graph neural networks in homophilic graphs. %Hence, suboptimal performance is obtained when these models are applied to heterophilic graphs. Second, existing models based on meta-learning entirely depend on instance-based statistics. %which in few-shot settings are unavoidably degraded by data noise or outliers. Third, most previous models treat all sampled tasks equally and fail to adapt their uniqueness. %which has a significant impact on the overall performance of the model. To solve the above three limitations, we propose a novel graph Meta -learning framework called G raph learning based on P rototype and S caling & shifting transformation (Meta-GPS ). More specifically, we introduce an efficient method for learning expressive node representations even on heterophilic graphs and propose utilizing a prototype-based approach to initialize parameters in meta-learning. Moreover, we also leverage S (scaling & shifting) transformation to learn effective transferable knowledge from diverse tasks. Extensive experimental results on six real-world datasets demonstrate the superiority of our proposed framework, which outperforms other state-of-the-art baselines by up to 13% absolute improvement in terms of related metrics.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper14
- Leveraging Large Language Models for Node Generation in Few-Shot Learning on Text-Attributed GraphsJianxiang Yu, Yuxiang Ren, Chenghua Gong, Jiaqi Tan 等AAAI 2025 · 被引用 32 次
- Question Calibration and Multi-Hop Modeling for Temporal Question AnsweringChao Xue, Di Liang, Pengfei Wang, Jing ZhangAAAI 2024 · 被引用 27 次
- Task-Equivariant Graph Few-shot LearningSungwon Kim, Junseok Lee, Namkyeong Lee, Wonjoong Kim 等KDD 2023 · 被引用 9 次
- Dual-level Mixup for Graph Few-shot Learning with Fewer TasksYonghao Liu, Mengyu Li, Fausto Giunchiglia, Lan Huang 等WWW 2025 · 被引用 8 次
- Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node ClassificationYihong Luo, Yuhan Chen, Siya Qiu, Yiwei Wang 等NeurIPS 2024 · 被引用 7 次
相关 Paper
- Few-Shot Graph Learning for Molecular Property PredictionZhichun Guo, Chuxu Zhang, Wenhao Yu, John Herr 等WWW 2021 · 被引用 213 次
- Relative and Absolute Location Embedding for Few-Shot Node Classification on GraphZemin Liu, Yuan Fang, Chenghao Liu, Steven C. H. HoiAAAI 2021 · 被引用 103 次
- Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network EmbeddingLin Lan, Pinghui Wang, Xuefeng Du, Kaikai Song 等NeurIPS 2020 · 被引用 50 次
- Meta Propagation Networks for Graph Few-shot Semi-supervised LearningKaize Ding, Jianling Wang, James Caverlee, Huan LiuAAAI 2022 · 被引用 56 次
- Hybrid Graph Neural Networks for Few-Shot LearningTianyuan Yu, Sen He, Yi-Zhe Song, Tao XiangAAAI 2022 · 被引用 77 次
