Digital.CSIC > Ciencia y Tecnologías Físicas > Instituto de Robótica e Informática Industrial (IRII) > (IRII) Libros y partes de libros >




Open Access item Computing the Barycenter Graph by Means of the Graph Edit Distance

Authors:Bardaji, I.
Ferrer, Miquel
Sanfeliu, Alberto
Issue Date:2010
Publisher:Institute of Electrical and Electronics Engineers
Citation:20th International Conference on Pattern Recognition: 962-965 (2010)
Abstract:The barycenter graph has been shown as an alternative to obtain the representative of a given set of graphs. In this paper we propose an extension of the original algorithm which makes use of the graph edit distance in conjunction with the weighted mean of a pair of graphs. Our main contribution is that we can apply the method to attributed graphs with any kind of labels in both the nodes and the edges, equipped with a distance function less constrained than in previous approaches. Experiments done on four different datasets support the validity of the method giving good approximations of the barycenter graph.
Description:Trabajo presentado a la ICPR 2010 celebrada en Estambul del 23 al 26 de agosto.
Publisher version (URL):http://dx.doi.org/10.1109/ICPR.2010.241
Appears in Collections:(IRII) Libros y partes de libros

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.