toggle visibility Search & Display Options

Select All    Deselect All
 |   | 
Details
   print
  Record Links
Author (up) Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; Horst Bunke edit  doi
isbn  openurl
  Title A Recursive Embedding Approach to Median Graph Computation Type Conference Article
  Year 2009 Publication 7th IAPR – TC–15 Workshop on Graph–Based Representations in Pattern Recognition Abbreviated Journal  
  Volume 5534 Issue Pages 113–123  
  Keywords  
  Abstract 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.  
  Address Venice, Italy  
  Corporate Author Thesis  
  Publisher Springer Berlin Heidelberg Place of Publication Editor  
  Language Summary Language Original Title  
  Series Editor Series Title Abbreviated Series Title LNCS  
  Series Volume Series Issue Edition  
  ISSN 0302-9743 ISBN 978-3-642-02123-7 Medium  
  Area Expedition Conference GBR  
  Notes DAG Approved no  
  Call Number DAG @ dag @ FKV2009 Serial 1173  
Permanent link to this record
Select All    Deselect All
 |   | 
Details
   print

Save Citations:
Export Records: