AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Generalizing Downsampling from Regular Data to Graphs

Davide Bacciu, Alessio Conte, Francesco Landolfi

AAAI 2023 · Graph learning › Graph algorithms and clustering · approach: Graph distance and retrieval · 5 citations (OpenAlex)

Read the paper

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use k-MIS max-pooling instead of EdgePoolGraph classification model · REDDIT-Baccuracy: 85.98 ± 1.57 -> 87.57 ± 1.96Improved
Use k-MIS strided reduction instead of EdgePoolGraph classification model · REDDIT-5Kaccuracy: 52.44 ± 1.11 -> 54.30 ± 0.53Improved
Use k-MIS mean-pooling instead of the no-pooling baselineGraph classification model · GITHUBaccuracy: 69.89 ± 0.28 -> 68.60 ± 0.67Hurt
Use k-MIS pooling instead of the no-pooling baselineGraph classification model · DDaccuracy: 75.51 ± 1.07 -> 76.91 ± 1.06Mixed
Use k-MIS pooling instead of the no-pooling baselineGraph classification model · REDDIT-12Kaccuracy: 45.04 ± 6.63 -> 47.51 ± 0.99Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy