English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30161
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:


A comparison between two representatives of a set of graphs: median vs barycenter graph

AuthorsBardaji, I.; Ferrer, Miquel ; Sanfeliu, Alberto
KeywordsMedian graph
Barycenter graph
Graph matching
Pattern recognition
Pattern recognition systems
Issue Date2010
CitationStructural, Syntactic, and Statistical Pattern Recognition: 149-158 (2010)
SeriesLecture Notes in Computer Science 6218
AbstractIn 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.
DescriptionTrabajo presentado al Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR) celebrado en Esmirna (Turquía) del 18 al 20 de agosto de 2010.
Publisher version (URL)http://dx.doi.org/10.1007/978-3-642-14980-1_14
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
Comparison between Two.pdf157,45 kBAdobe PDFThumbnail
Show full item record
Review this work

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