Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/38635
Share/Impact:
Título : Computing the Barycenter Graph by Means of the Graph Edit Distance
Autor : Bardaji, I., Ferrer, Miquel, Sanfeliu, Alberto
Fecha de publicación : 2010
Editor: Institute of Electrical and Electronics Engineers
Resumen: 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.
Descripción : Trabajo presentado a la ICPR 2010 celebrada en Estambul del 23 al 26 de agosto.
Versión del editor: http://dx.doi.org/10.1109/ICPR.2010.241
URI : http://hdl.handle.net/10261/38635
ISBN : 978-1-4244-7542-1
DOI: 10.1109/ICPR.2010.241
Citación : 20th International Conference on Pattern Recognition: 962-965 (2010)
Appears in Collections:(IRII) Libros y partes de libros

Files in This Item:
File Description SizeFormat 
Computing the Barycenter.pdf393,67 kBAdobe PDFView/Open
Show full item record
 
CSIC SFX LinksSFX Query

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