Median graph computation by means of a genetic approach based on minimum common supergraph and maximum common subraph
Document typePart of book or chapter of book
PublisherSpringer Berlin / Heidelberg
Rights accessRestricted access - publisher's policy
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.
CitationFerrer, M.; Valveny, E.; Serratosa, F. Median graph computation by means of a genetic approach based on minimum common supergraph and maximum common subraph. A: "Pattern recognition and image analysis". Springer Berlin / Heidelberg, 2009, p. 346-353.
|meidan_graph.pdf||Capítol de llibre||276,7Kb||Restricted access|