PT Unknown
AU Miquel Ferrer
   Dimosthenis Karatzas
   Ernest Valveny
   Horst Bunke
TI A Recursive  Embedding Approach to Median Graph Computation
BT 7th IAPR – TC–15 Workshop on Graph–Based Representations in Pattern Recognition
PY 2009
BP 113–123
VL 5534
DI 10.1007/978-3-642-02124-4_12
AB 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.
ER