Designing labeled graph classifiers by exploiting the Rényi entropy of the dissimilarity representation

08/22/2014
by   Lorenzo Livi, et al.
0

Representing patterns as labeled graphs is becoming increasingly common in the broad field of computational intelligence. Accordingly, a wide repertoire of pattern recognition tools, such as classifiers and knowledge discovery procedures, are nowadays available and tested for various datasets of labeled graphs. However, the design of effective learning procedures operating in the space of labeled graphs is still a challenging problem, especially from the computational complexity viewpoint. In this paper, we present a major improvement of a general-purpose classifier for graphs, which is conceived on an interplay between dissimilarity representation, clustering, information-theoretic techniques, and evolutionary optimization algorithms. The improvement focuses on a specific key subroutine devised to compress the input data. We prove different theorems which are fundamental to the setting of the parameters controlling such a compression operation. We demonstrate the effectiveness of the resulting classifier by benchmarking the developed variants on well-known datasets of labeled graphs, considering as distinct performance indicators the classification accuracy, computing time, and parsimony in terms of structural complexity of the synthesized classification models. The results show state-of-the-art standards in terms of test set accuracy and a considerable speed-up for what concerns the computing time.

READ FULL TEXT
research
07/28/2014

Entropic one-class classifiers

The one-class classification problem is a well-known research endeavor i...
research
07/15/2023

Computing SEQ-IC-LCS of Labeled Graphs

We consider labeled directed graphs where each vertex is labeled with a ...
research
10/20/2014

Building pattern recognition applications with the SPARE library

This paper presents the SPARE C++ library, an open source software tool ...
research
04/08/2016

One-class classifiers based on entropic spanning graphs

One-class classifiers offer valuable tools to assess the presence of out...
research
07/18/2018

An Information-theoretic Framework for the Lossy Compression of Link Streams

Graph compression is a data analysis technique that consists in the repl...
research
07/30/2014

Characterization of graphs for protein structure modeling and recognition of solubility

This paper deals with the relations among structural, topological, and c...

Please sign up or login with your details

Forgot password? Click here to reset