%0 Conference Proceedings
%T On the Correlation of Graph Edit Distance and L1 Distance in the Attribute Statistics Embedding Space
%A Jaume Gibert
%A Ernest Valveny
%A Horst Bunke
%A Alicia Fornes
%B Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop
%D 2012
%V 7626
%I Springer-Berlag, Berlin
%@ 978-3-642-34165-6
%F Jaume Gibert2012
%O DAG
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=2167), last updated on Tue, 18 Oct 2016 13:48:01 +0200
%X Graph embeddings in vector spaces aim at assigning a pattern vector to every graph so that the problems of graph classification and clustering can be solved by using data processing algorithms originally developed for statistical feature vectors. An important requirement graph features should fulfil is that they reproduce as much as possible the properties among objects in the graph domain. In particular, it is usually desired that distances between pairs of graphs in the graph domain closely resemble those between their corresponding vectorial representations. In this work, we analyse relations between the edit distance in the graph domain and the L1 distance of the attribute statistics based embedding, for which good classification performance has been reported on various datasets. We show that there is actually a high correlation between the two kinds of distances provided that the corresponding parameter values that account for balancing the weight between node and edge based features are properly selected.
%U http://refbase.cvc.uab.es/files/GVB2012c.pdf
%U http://dx.doi.org/10.1007/978-3-642-34166-3_15
%P 135-143