Core Knowledge Learning Framework for Graph
Bowen Zhang, Zhichao Huang, Guangning Xu, Xiaomao Fan, Mingyan Xiao, Genan Dai, Hu Huang
摘要
Graph classification is a pivotal challenge in machine learning, especially within the realm of graph-based data, given its importance in numerous real-world applications such as social network analysis, recommendation systems, and bioinformatics. Despite its significance, graph classification faces several hurdles, including adapting to diverse prediction tasks, training across multiple target domains, and handling small-sample prediction scenarios. Current methods often tackle these challenges individually, leading to fragmented solutions that lack a holistic approach to the overarching problem. In this paper, we propose an algorithm aimed at addressing the aforementioned challenges. By incorporating insights from various types of tasks, our method aims to enhance adaptability, scalability, and generalizability in graph classification. Motivated by the recognition that the underlying subgraph plays a crucial role in GNN prediction, while the remainder is task-irrelevant, we introduce the Core Knowledge Learning (CKL) framework for graph adaptation and scalability learning. CKL comprises several key modules, including the core subgraph knowledge submodule, graph domain adaptation module, and few-shot learning module for downstream tasks. Each module is tailored to tackle specific challenges in graph classification, such as domain shift, label inconsistencies, and data scarcity. By learning the core subgraph of the entire graph, we focus on the most pertinent features for task relevance. Consequently, our method offers benefits such as improved model performance, increased domain adaptability, and enhanced robustness to domain variations. Experimental results demonstrate significant performance enhancements achieved by our method compared to state-of-the-art approaches. Specifically, our method achieves notable improvements in accuracy and generalization across various datasets and evaluation metrics, underscoring its effectiveness in addressing the challenges of graph classification. CCS CONCEPTS • Mathematics of computing → Graph algorithms; • Computing methodologies → Neural networks.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper25
- DropEdge: Towards Deep Graph Convolutional Networks on Node ClassificationYu Rong, Wenbing Huang, Tingyang Xu, Junzhou HuangICLR 2020 · 被引用 1,599 次
- Parameterized Explainer for Graph Neural NetworkDongsheng Luo, Wei Cheng, Dongkuan Xu, Wenchao Yu 等NeurIPS 2020 · 被引用 888 次
- Weisfeiler and Lehman Go Cellular: CW NetworksCristian Bodnar, Fabrizio Frasca, Nina Otter, Yuguang Wang 等NeurIPS 2021 · 被引用 330 次
- From Local Structures to Size Generalization in Graph Neural NetworksGilad Yehudai, Ethan Fetaya, Eli A. Meirom, Gal Chechik 等ICML 2021 · 被引用 167 次
- Transfer Learning of Graph Neural Networks with Ego-graph Information MaximizationQi Zhu, Carl Yang, Yidan Xu, Haonan Wang 等NeurIPS 2021 · 被引用 140 次
相关 Paper
- Cluster-guided Contrastive Class-imbalanced Graph ClassificationWei Ju, Zhengyang Mao, Siyu Yi, Yifang Qin 等AAAI 2025 · 被引用 6 次
- GraphFLEx: Unsupervised Structure Learning ramework for arge panding sMohit Kataria, Nikita Malik, Jayadeva Jayadeva, Sandeep KumarICML 2026
- Task-Adaptive Few-shot Node ClassificationSong Wang, Kaize Ding, Chuxu Zhang, Chen Chen 等KDD 2022 · 被引用 40 次
- MuGSI: Distilling GNNs with Multi-Granularity Structural Information for Graph ClassificationTianjun Yao, Jiaqi Sun, Defu Cao, Kun Zhang 等WWW 2024 · 被引用 9 次
- Algorithm and System Co-design for Efficient Subgraph-based Graph Representation LearningHaoteng Yin, Muhan Zhang, Yanbang Wang, Jianguo Wang 等VLDB 2022 · 被引用 47 次
