Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network
Wendong Bi, Bingbing Xu, Xiaoqian Sun, Easton Li Xu, Huawei Shen, Xueqi Cheng
Abstract
Graphs consisting of vocal nodes ("the vocal minority") and silent nodes ("the silent majority"), namely VS-Graph, are ubiquitous in the real world. The vocal nodes tend to have abundant features and labels. In contrast, silent nodes only have incomplete features and rare labels, e.g., the description and political tendency of politicians (vocal) are abundant while not for ordinary civilians (silent) on the twitter's social network. Predicting the silent majority remains a crucial yet challenging problem. However, most existing Graph Neural Networks (GNNs) assume that all nodes belong to the same domain, without considering the missing features and distribution-shift between domains, leading to poor ability to deal with VS-Graph. To combat the above challenges, we propose Knowledge Transferable Graph Neural Network (KTGNN), which models distribution-shifts during message passing and learns representation by transferring knowledge from vocal nodes to silent nodes. Specifically, we design the domain-adapted "feature completion and message passing mechanism" for node representation learning while preserving domain difference. And a knowledge transferable classifier based on KL-divergence is followed. Comprehensive experiments on real-world scenarios (i.e., company financial risk assessment and political elections) demonstrate the superior performance of our method. Our source code has been open-sourced 1 .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4c72285c-44cb-4038-8e4e-1726be82a9a4Cited by top-tier papers4
- On Manipulating Signals of User-Item Graph: A Jacobi Polynomial-based Graph Collaborative FilteringJiayan Guo, Lun Du, Xu Chen, Xiaojun Ma et al.KDD 2023 · 21 citations
- GraphGLOW: Universal and Generalizable Structure Learning for Graph Neural NetworksWentao Zhao, Qitian Wu, Chenxiao Yang, Junchi YanKDD 2023 · 14 citations
- Energy-based Out-of-Distribution Detection for Graph Neural NetworksQitian Wu, Yiting Chen, Chenxiao Yang, Junchi YanICLR 2023 · 8 citations
- LinkThief: Combining Generalized Structure Knowledge with Node Similarity for Link Stealing Attack against GNNYuxing Zhang, Siyuan Meng, Chunchun Chen, Mengyao Peng et al.ACM MM 2024 · 1 citation
Builds on16
- How Attentive are Graph Attention Networks?Shaked Brody, Uri Alon, Eran YahavICLR 2022 · 1,717 citations
- GCC: Graph Contrastive Coding for Graph Neural Network Pre-TrainingJiezhong Qiu, Qibin Chen, Yuxiao Dong, Jing Zhang et al.KDD 2020 · 755 citations
- Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud DetectionYang Liu, Xiang Ao, Zidi Qin, Jianfeng Chi et al.WWW 2021 · 527 citations
- Towards Deeper Graph Neural NetworksMeng Liu, Hongyang Gao, Shuiwang JiKDD 2020 · 496 citations
- Discovering Invariant Rationales for Graph Neural NetworksYingxin Wu, Xiang Wang, An Zhang, Xiangnan He et al.ICLR 2022 · 313 citations
Related papers
- Zero-shot Transfer Learning within a Heterogeneous Graph via Knowledge Transfer NetworksMinji Yoon, John Palowitch, Dustin Zelle, Ziniu Hu et al.NeurIPS 2022 · 16 citations
- Unsupervised Domain Adaptive Graph Convolutional NetworksMan Wu, Shirui Pan, Chuan Zhou, Xiaojun Chang et al.WWW 2020 · 221 citations
- SA-GDA: Spectral Augmentation for Graph Domain AdaptationJinhui Pang, Zixuan Wang, Jiliang Tang, Mingyan Xiao et al.ACM MM 2023 · 14 citations
- Smoothness Really Matters: A Simple Yet Effective Approach for Unsupervised Graph Domain AdaptationWei Chen, Guo Ye, Yakun Wang, Zhao Zhang et al.AAAI 2025 · 13 citations
- Knowledge-Guided Domain Adaptation Model for Transferring Drug Response Prediction from Cell Lines to PatientsXuan Liu, Menglu LiAAAI 2025 · 6 citations
