A Benchmarking Framework for Network Classification Methods

TL;DR

This paper introduces a new benchmark dataset of synthetic networks with noise to evaluate various network classification methods, revealing that the improved Deterministic Tourist Walk outperforms others in noisy conditions.

Contribution

The paper presents a novel benchmark dataset and a comprehensive evaluation of multiple feature extraction techniques for network classification, highlighting the superior performance of DTWB.

Findings

DTWB outperforms other methods in noisy environments

Topological measures perform poorly compared to advanced techniques

LLNA and DTW also show strong classification accuracy

Abstract

Network classification plays a crucial role in the study of complex systems, impacting fields like biology, sociology, and computer science. In this research, we present an innovative benchmark dataset made up of synthetic networks that are categorized into various classes and subclasses. This dataset is specifically crafted to test the effectiveness and resilience of different network classification methods. To put these methods to the test, we also introduce various types and levels of structural noise. We evaluate five feature extraction techniques: traditional structural measures, Life-Like Network Automata (LLNA), Graph2Vec, Deterministic Tourist Walk (DTW), and its improved version, the Deterministic Tourist Walk with Bifurcation (DTWB). Our experimental results reveal that DTWB surpasses the other methods in classifying both classes and subclasses, even when faced with significant noise. LLNA and DTW also perform well, while Graph2Vec lands somewhere in the middle in terms of accuracy. Interestingly, topological measures, despite their simplicity and common usage, consistently show the weakest classification performance. These findings underscore the necessity of robust feature extraction techniques for effective network classification, particularly in noisy conditions.