Publication
A comparison between two representatives of a set of graphs: median vs barycenter graph
Conference Article
Conference
Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR)
Edition
13th
Pages
149-158
Doc link
http://dx.doi.org/10.1007/978-3-642-14980-1_14
File
Abstract
In this paper we consider two existing methods to generate a representative of a given set of graphs, that satisfy the following two conditions. On the one hand, that they are applicable to graphs with any kind of labels in nodes and edges and on the other hand, that they can handle relatively large amount of data. Namely, the approximated algorithms to compute the Median Graph via graph embedding and a new method to compute the Barycenter Graph. Our contribution is to give a new algorithm for the barycenter computation and to compare it to the median Graph. To compare these two representatives, we take into account algorithmic considerations and experimental results on the quality of the representative and its robustness, on several datasets.
Categories
pattern recognition.
Author keywords
median graph, barycenter graph, graph matching
Scientific reference
I. Bardaji, M. Ferrer and A. Sanfeliu. A comparison between two representatives of a set of graphs: median vs barycenter graph, 13th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition, 2010, Izmir, Turkey, in Structural, Syntactic, and Statistical Pattern Recognition, Vol 6218 of Lecture Notes in Computer Science, pp. 149-158, 2010, Springer, Berlin.
Follow us!