TL;DR
This paper introduces AdaCAD, a novel graph neural network method that adaptively emphasizes intra-class relationships using class-attentive diffusion, leading to improved semi-supervised classification performance.
Contribution
The paper proposes a new class-attentive diffusion process and an adaptive update scheme, enhancing semi-supervised graph classification by better handling inter-class connections.
Findings
Outperforms state-of-the-art methods on seven benchmark datasets.
Effectively mitigates inter-class feature mixing.
Demonstrates robustness across diverse graph structures.
Abstract
Recently, graph neural networks for semi-supervised classification have been widely studied. However, existing methods only use the information of limited neighbors and do not deal with the inter-class connections in graphs. In this paper, we propose Adaptive aggregation with Class-Attentive Diffusion (AdaCAD), a new aggregation scheme that adaptively aggregates nodes probably of the same class among K-hop neighbors. To this end, we first propose a novel stochastic process, called Class-Attentive Diffusion (CAD), that strengthens attention to intra-class nodes and attenuates attention to inter-class nodes. In contrast to the existing diffusion methods with a transition matrix determined solely by the graph structure, CAD considers both the node features and the graph structure with the design of our class-attentive transition matrix that utilizes a classifier. Then, we further propose…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
