Loading...
Loading...

Go to the content (press return)

An iterative algorithm for approximate median graph computation

Author
Ferrer, M.; Bunke, H.
Type of activity
Presentation of work at congresses
Name of edition
20th International Conference on Pattern Recognition
Date of publication
2010
Presentation's date
2010
Book of congress proceedings
20th International Conference on Pattern Recognition (ICPR), 2010: 23-26 Aug. 2010, Istanbul, Turkey: proceedings
First page
1562
Last page
1565
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
DOI
https://doi.org/10.1109/ICPR.2010.386 Open in new window
Repository
http://hdl.handle.net/2117/19344 Open in new window
URL
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=5595790&contentType=Conference+Publications Open in new window
Abstract
Recently, the median graph has been shown to be a good choice to obtain a representative of a given set of graphs. It has been successfully applied to graph-based classification and clustering. In this paper we exploit a theoretical property of the median, which has not yet been utilized in the past, to derive a new iterative algorithm for approximate median graph computation. Experiments done using five different graph databases show that the proposed approach yields, in four out of these five ...
Citation
Ferrer, M.; Bunke, H. An iterative algorithm for approximate median graph computation. A: International Conference on Pattern Recognition. "20th International Conference on Pattern Recognition (ICPR), 2010: 23-26 Aug. 2010, Istanbul, Turkey: proceedings". Institute of Electrical and Electronics Engineers (IEEE), 2010, p. 1562-1565.
Group of research
VIS - Artificial Vision and Intelligent Systems

Participants

  • Ferrer Sumsi, Miquel  (author and speaker )
  • Bunke, Horst  (author and speaker )