Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30131
Share/Impact:
Título : A recursive embedding approach to median graph computation
Autor : Ferrer, Miquel, Karatzas, D., Valveny, Ernest, Bunke, Horst
Palabras clave : Pattern recognition
Pattern recognition systems
Fecha de publicación : 2009
Editor: Springer
Citación : Lecture Notes in Computer Science 5534
Resumen: The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper We present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments oil three databases show that this new approach is able to obtain better medians than the previous existing approaches.
Descripción : Trabajo presentado al 7th GbRPR celebrado en Venecia del 26 al 28 de mayo de 2009.
Versión del editor: http://dx.doi.org/10.1007/978-3-642-02124-4_12
URI : http://hdl.handle.net/10261/30131
ISBN : 978-3-642-02123-7
DOI: 10.1007/978-3-642-02124-4_12
Citación : Graph-Based Representations in Pattern Recognition: 113-123 (2009)
Appears in Collections:(IRII) Libros y partes de libros

Files in This Item:
File Description SizeFormat 
recursive embedding.pdf252,78 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.