Graph Pooling
Graph Pooling is a dimensionality reduction technique in graph-based learning that hierarchically coarsens graph structures by selectively aggregating nodes or subgraphs to preserve topological and feature information at multiple scales.
116
Publications
8.4K
Citations
427
Authors
163
Institutions
Publications per year
2017–2026
114
116
Hierarchical Graph Representation Learning with Differentiable Pooling
Rex Ying, Jiaxuan You, Christopher Morris et al. · arXiv (Cornell University) · 2018 · 841 citations · Full text
Sequential Recommendation with Graph Neural Networks
Jianxin Chang, Chen Gao, Yu Zheng et al. · 2021 · 423 citations
Junhyun Lee, Inyeop Lee, Jaewoo Kang · arXiv (Cornell University) · 2019 · 378 citations · Full text
1–5 of 116
427
8
h-index
5
h-index
5
h-index
4
h-index
4
h-index
1–5 of 427
163
Texas A&M University
College Station, United States
9 h-index
20 publications
2.3K citations
University of Science and Technology of China
Hefei, China
6 h-index
10 publications
663 citations
University of Chinese Academy of Sciences
Beijing, China
6 h-index
13 publications
583 citations

Chinese Academy of Sciences
Beijing, China
5 h-index
14 publications
762 citations
Institute of Automation
Beijing, China
5 h-index
15 publications
971 citations
Tsinghua University
Beijing, China
5 h-index
14 publications
2.4K citations
Tongji University
Shanghai, China
4 h-index
9 publications
336 citations

The University of Sydney
Sydney, Australia
4 h-index
7 publications
335 citations
1–8 of 163
Repository · 24 publications · 2.3K citations
19
h-index
TPAMI · 5 publications · 676 citations
5
h-index
TKDE · 5 publications · 194 citations
5
h-index
4 publications · 173 citations
4
h-index
3 publications · 213 citations
3
h-index
1–5