mlsanityData to 7 Oct 2026

A Simple Baseline Algorithm for Graph Classification

arXiv 1810.09155 ↗First posted 22 Oct 2018cs.LG stat.MLcited by 15

Not on the map. Why?

Abstract (arXiv)

Graph classification has recently received a lot of attention from various fields of machine learning e.g. kernel methods, sequential modeling or graph embedding. All these approaches offer promising results with different respective strengths and weaknesses. However, most of them rely on complex mathematics and require heavy computational power to achieve their best performance. We propose a simple and fast algorithm based on the spectral decomposition of graph Laplacian to perform graph classification and get a first reference score for a dataset. We show that this method obtains competitive results compared to state-of-the-art algorithms.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Oct 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 2; 2023: 2; 2024: 4; 2025: 1; 2026: 1.

15 papers.

Sort: