On Exploring Node-feature and Graph-structure Diversities for Node Drop Graph Pooling
Chuang Liu, Yibing Zhan, Baosheng Yu, Liu Liu, Bo Du, Wenbin Hu,, Tongliang Liu

TL;DR
This paper introduces MID, a novel multidimensional score scheme for node drop pooling that considers node feature and graph structure diversities, leading to improved graph classification performance.
Contribution
The paper proposes MID, a plug-and-play score scheme with flipscore and dropscore, to enhance node drop pooling by capturing feature and structural diversities.
Findings
Achieves about 2.8% average improvement over existing methods.
Effective across diverse real-world graph datasets.
Enhances the diversity-aware node selection process.
Abstract
A pooling operation is essential for effective graph-level representation learning, where the node drop pooling has become one mainstream graph pooling technology. However, current node drop pooling methods usually keep the top-k nodes according to their significance scores, which ignore the graph diversity in terms of the node features and the graph structures, thus resulting in suboptimal graph-level representations. To address the aforementioned issue, we propose a novel plug-and-play score scheme and refer to it as MID, which consists of a \textbf{M}ultidimensional score space with two operations, \textit{i.e.}, fl\textbf{I}pscore and \textbf{D}ropscore. Specifically, the multidimensional score space depicts the significance of nodes through multiple criteria; the flipscore encourages the maintenance of dissimilar node features; and the dropscore forces the model to notice diverse…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks
