arrow
Return

On exploring node-feature and graph-structure diversities for node drop graph pooling

delete2023-10-01
delete8
delete
OA
AI
C
Chuang Liu
Y
Yibing Zhan
B
Baosheng Yu
L
Liu Liu
B
Bo Du
W
Wenbin Hu *
Tongliang Liu cover
Tongliang Liu (Tongliang Liu)
DOI:10.1016/j.neunet.2023.08.046delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Graph Neural Networks (GNNs) have been successfully applied to graph-level tasks in various fields such as biology, social networks, computer vision, and natural language processing. For the graph level representations learning of GNNs, graph pooling plays an essential role. Among many pooling techniques, node drop pooling has garnered significant attention and is considered as a leading approach. However, existing node drop pooling methods, which typically retain the top-k nodes based on their significance scores, often overlook the diversity inherent in node features and graph structures. This limitation leads to suboptimal graph-level representations. To overcome this, we introduce a groundbreaking plug-and-play score scheme, termed MID. MID comprises a Multidimensional score space and two key operations: flIpscore and Dropscore. The multidimensional score space depicts the significance of nodes by multiple criteria; the flipscore process promotes the preservation of distinct node features; the dropscore compels the model to take into account a range of graph structures rather than focusing on local structures. To evaluate the effectiveness of our proposed MID, we have conducted extensive experiments by integrating it with a broad range of recent node drop pooling methods, such as TopKPool, SAGPool, GSAPool, and ASAP. In particular, MID has proven to bring a significant average improvement of approximately 2.8% over the four aforementioned methods when tested on 17 real-world graph classification datasets. Code is available at https://github.com/ whuchuang/mid.(c) 2023 Elsevier Ltd. All rights reserved.
Keywords:
Graph neural networks
Graph pooling
Graph classification
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Neural Networks cover
Neural Networks
IF:
6.3
Papers:
8.2K
Citations:
3.0W

Organization

U
University of Sydney
Scholars:
6.5W
Papers: 6.2W
Citations: 90
W
wuhan university
Scholars:
8.1W
Papers: 5.8W
Citations: 70
Cited Papers

Cited Papers

err2001-01-01
err0
PREAI
errC. Serré; M. Vayer; R. Erre
errShare
errSave
FPGA implementation of sound encryption system based on fractional-order chaotic systems
err2019-08-01
err0
PREAI
errAhmed J. Abd El-Maksoud; Ayman A. Abd El-Kader; Bahy G. Hassan; Nader G. Rihan; Mohamed F. Tolba; Lobna A. Said; Ahmed G. Radwan; Mohamed F. Abu-Elyazeed
errShare
errSave
TRAPP Complexes in Secretion and Autophagy
err2016-03-30
err0
errOAAI
errJane J. Kim; Zhanna Lipatova; Nava Segev
errShare
errSave
Admixture Effects on the Rheological/Mechanical Behavior and Micro-Structure Evolution of Alkali-Activated Slag Backfills
err2022-12-25
err0
errOAAI
errXubo Ji; Xiaozhong Gu; Zhuoran Wang; Shuai Xu; Haiqiang Jiang; Erol Yilmaz
errShare
errSave
ZINC: A Free Tool to Discover Chemistry for Biology
err2012-06-15
err2.1K
errOAAI
errIrwin, John J.; Sterling, Teague; Mysinger, Michael M.; Bolstad, Erin S.; Coleman, Ryan G.
errShare
errSave
errShare
errSave
MoleculeNet: a benchmark for molecular machine learning
err2018-01-01
err1.6K
errOAAI
errWu, Zhenqin; Ramsundar, Bharath; Feinberg, Evan N.; Gomes, Joseph; Geniesse, Caleb; Pappu, Aneesh S.; Leswing, Karl; Pande, Vijay
errShare
errSave
Learning Graph Convolutional Networks Based on Quantum Vertex Information Propagation
err2021-01-01
err17
errOAAI
errBai, Lu; Jiao, Yuhang; Cui, Lixin; Rossi, Luca; Wang, Yue; Yu, Philip S.; Hancock, Edwin R.
errShare
errSave
researcher View more