English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30135
Title: Median graph computation by means of a genetic approach based on minimum common supergraph and maximum common subraph
Authors: Ferrer, Miquel; Valveny, Ernest; Serratosa, Francesc
Issue Date: 2009
Publisher: Springer
Citation: Pattern Recognition and Image Analysis: 346-353 (2009)
Series/Report no.: Lecture Notes in Computer Science 5524
Abstract: Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present a new genetic algorithm for the median graph computation. A set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity, show that we obtain good approximations of the median graph. Finally, we use the median graph in a real nearest neighbour classification showing that it leaves the box of the only-theoretical concepts and demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs.
Description: Trabajo presentado al 4th IbPRIA celebrado en Portugal del 10 al 12 de junio de 2009.
Publisher version (URL): http://dx.doi.org/10.1007/978-3-642-02172-5_45
URI: http://hdl.handle.net/10261/30135
ISBN: 978-3-642-02171-8
DOI: 10.1007/978-3-642-02172-5_45
Appears in Collections:(IRII) Libros y partes de libros
Files in This Item:
File Description SizeFormat 
Median Graph Computation.pdf318,63 kBAdobe PDFThumbnail
Show full item record

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