A multi-agent approach for graph classification

In this paper, we propose and discuss a prototypical framework for graph classification. The proposed algorithm (Graph E-ABC) exploits a multi-agent design, where swarm of agents (orchestrated via evolutionary optimization) are in charge of finding meaningful substructures from the training data. The resulting set of substructures compose the pivotal entities for a graph embedding procedure that allows to move the pattern recognition problem from the graph domain towards the Euclidean space. In order to improve the learning capabilities, the pivotal substructures undergo an independent optimization procedure. The performances of Graph E-ABC are addressed via a sensitivity analysis over its critical parameters and compared against current approaches for graph classification. Results on five open access datasets of fully labelled graphs show interesting performances in terms of accuracy, counterbalanced by a relatively high number of pivotal substructures.