An Enhanced Filtering-Based Information Granulation Procedure for Graph Embedding and Classification

Granular Computing is a powerful information processing paradigm for synthesizing advanced pattern recognition systems in non-conventional domains. In this article, a novel procedure for the automatic synthesis of suitable information granules is proposed. The procedure leverages a joint sensitivity-vs-specificity score that accounts the meaningfulness of candidate information granules for each class considered in the classification problem at hand. Only statistically relevant granules are retained for a graph embedding procedure towards a geometric space, in which standard classification systems can be used without alterations. Performance tests have been carried out by considering open access datasets of fully labelled graphs with arbitrarily complex nodes and/or edges attributes that, by definition, must rely on inexact graph matching procedures to quantify dissimilarities. Two variants of the procedure are investigated: a standard variant, which aims at automatically finding suitable information granules for solving the classification problem as a whole, and a class-specific metric learning variant, in which the optimization procedure is performed in a class-aware fashion. In the latter case, each class will have its own set of information granules, along with the corresponding parameters defining distinct instances of the dissimilarity measure. Computational results show that the proposed algorithm is able to outperform the vast majority of current approaches for graph classification, while at the same time returning a grey-box model, interpretable by field-experts.