English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/38635
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Computing the Barycenter Graph by Means of the Graph Edit Distance

AuthorsBardaji, I.; Ferrer, Miquel ; Sanfeliu, Alberto
Issue Date2010
PublisherInstitute of Electrical and Electronics Engineers
Citation20th International Conference on Pattern Recognition: 962-965 (2010)
AbstractThe 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.
DescriptionTrabajo 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
URIhttp://hdl.handle.net/10261/38635
DOI10.1109/ICPR.2010.241
ISBN978-1-4244-7542-1
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
Computing the Barycenter.pdf393,67 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


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