Sciweavers

GBRPR
2009
Springer

A Recursive Embedding Approach to Median Graph Computation

14 years 4 months ago
A Recursive Embedding Approach to Median Graph Computation
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 on three databases show that this new approach is able to obtain better medians than the previous existing approaches.
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven
Added 24 Jul 2010
Updated 24 Jul 2010
Type Conference
Year 2009
Where GBRPR
Authors Miquel Ferrer, Dimosthenis Karatzas, Ernest Valveny, Horst Bunke
Comments (0)