ICPR 2016 – Graph Distance Contest

Measuring the dissimilarity between graphs is a key step in data analysis based on graph representations. This contest focusses on the definition and the computation of general dissimilarity measures through two challenges:

Challenge 1: computation of the exact or an approximate graph edit distance
Challenge 2: computation of a dissimilarity measure for graph classification

Different datasets are considered with symbolic or numerical attributes on both nodes and edges. Methods submitted to Challenge 1 can also be submitted to Challenge 2.

This contest is supported by the Technical Committee on Graph-Based Representations in Pattern Recognition (TC 15) of the International Association of Pattern Recognition (IAPR)