LGMay 1, 2023

Strengthening structural baselines for graph classification using Local Topological Profile

arXiv:2305.00724v15 citationsHas Code
Originality Incremental advance
AI Analysis

This work provides a simple, fast, and scalable baseline for graph classification, addressing the need for robust and reproducible benchmarks in graph representation learning, though it is incremental as it builds upon existing LDP methods.

The authors tackled the problem of improving structural baselines for graph classification by proposing Local Topological Profile (LTP), which extends Local Degree Profile (LDP) with additional centrality measures and local vertex descriptors, achieving state-of-the-art results on 4 out of 9 benchmark datasets and outperforming or matching modern GNNs like Graph Isomorphism Network (GIN).

We present the analysis of the topological graph descriptor Local Degree Profile (LDP), which forms a widely used structural baseline for graph classification. Our study focuses on model evaluation in the context of the recently developed fair evaluation framework, which defines rigorous routines for model selection and evaluation for graph classification, ensuring reproducibility and comparability of the results. Based on the obtained insights, we propose a new baseline algorithm called Local Topological Profile (LTP), which extends LDP by using additional centrality measures and local vertex descriptors. The new approach provides the results outperforming or very close to the latest GNNs for all datasets used. Specifically, state-of-the-art results were obtained for 4 out of 9 benchmark datasets. We also consider computational aspects of LDP-based feature extraction and model construction to propose practical improvements affecting execution speed and scalability. This allows for handling modern, large datasets and extends the portfolio of benchmarks used in graph representation learning. As the outcome of our work, we obtained LTP as a simple to understand, fast and scalable, still robust baseline, capable of outcompeting modern graph classification models such as Graph Isomorphism Network (GIN). We provide open-source implementation at \href{https://github.com/j-adamczyk/LTP}{GitHub}.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes