Scalable Graph Classification via Random Walk Fingerprints (Extended Abstract)

Peiyan Li, Honglian Wang, Christian Böhm

Abstract

We design a lightweight structural feature extraction technique for graph classification. It leverages node subsets and connection strength reflected by random-walk-based heuristics, presenting a scalable, unsupervised, and easily interpretable alternative. We provide theoretical insights into our technical design and establish a relation between the extracted structural features and the graph spectrum. We show our method achieves high levels of computational efficiency while maintaining robust classification accuracy.
BibTeX
@inproceedings{li2025scalable,
  author = {Peiyan Li and Honglian Wang and Christian Böhm},
  title = {{Scalable Graph Classification via Random Walk Fingerprints (Extended Abstract)}},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year = {2025},
  doi = {10.24963/ijcai.2025/1215},
}

Loading related content...

Figure