Carregant...
Carregant...

Vés al contingut (premeu Retorn)

An iterative algorithm for approximate median graph computation

Autor
Ferrer, M.; Bunke, H.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
20th International Conference on Pattern Recognition
Any de l'edició
2010
Data de presentació
2010
Llibre d'actes
20th International Conference on Pattern Recognition (ICPR), 2010: 23-26 Aug. 2010, Istanbul, Turkey: proceedings
Pàgina inicial
1562
Pàgina final
1565
Editor
Institute of Electrical and Electronics Engineers (IEEE)
DOI
https://doi.org/10.1109/ICPR.2010.386 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/19344 Obrir en finestra nova
URL
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=5595790&contentType=Conference+Publications Obrir en finestra nova
Resum
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 ...
Citació
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.
Grup de recerca
VIS - Visió Artificial i Sistemes Intel.ligents

Participants

  • Ferrer Sumsi, Miquel  (autor ponent)
  • Bunke, Horst  (autor ponent)