Chain of Propagation Prompting for Node Classification
Yonghua Zhu, Zhenyun Deng, Yang Chen, Robert Amor, Michael Witbrock
Abstract
Graph Neural Networks (GNN) are an effective technique for node classification, but their performance is easily affected by the quality of the primitive graph and the limited receptive field of message-passing. In this paper, we propose a new self-attention method, namely Chain of Propagation Prompting (CPP), to address the above issues as well as reduce dependence on label information when employing self-attention for node classification. To do this, we apply the self-attention framework to reduce the impact of a low-quality graph and to obtain a maximal receptive field for the message-passing. We also design a simple pattern of message-passing as the prompt to make self-attention capture complex patterns and reduce the dependence on label information. Comprehensive experimental results on real graph datasets demonstrate that CPP outperforms all relevant comparison methods.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural NetworksZemin Liu, Xingtong Yu, Yuan Fang, Xinming ZhangWWW 2023 · 263 citations
- Motif-Matching Based Subgraph-Level Attentional Convolutional Network for Graph ClassificationHao Peng, Jianxin Li, Qiran Gong, Yuanxing Ning et al.AAAI 2020 · 75 citations
- Improving Breadth-Wise Backpropagation in Graph Neural Networks Helps Learning Long-Range DependenciesDenis Lukovnikov, Asja FischerICML 2021 · 16 citations
- Towards Deeper Graph Neural NetworksMeng Liu, Hongyang Gao, Shuiwang JiKDD 2020 · 496 citations
- Graph Neural Networks without PropagationLiang Yang, Qiuliang Zhang, Runjie Shi, Wenmiao Zhou et al.WWW 2023 · 11 citations
