An approximate algorithm for median graph computation using graph embedding

Proceedings - International Conference on Pattern Recognition

Volumn , Issue , 2008, Pages

  Ferrer, Miquel ^a   Valveny, Ernest ^a   Serratosa, Francesc ^b   Riesen, Kaspar ^c   Bunke, Horst ^c  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^c UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; GRAPHIC METHODS; VECTOR SPACES;

APPROXIMATE ALGORITHMS; BASIC OPERATION; CLASSIFICATION TASKS; GRAPH EMBEDDINGS; LARGE GRAPHS; NEW APPROACHES; OBJECT REPRESENTATIONS; REAL DATABASE;

PATTERN RECOGNITION;

EID: 77957960317     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icpr.2008.4761354     Document Type: Conference Paper

References (10)

1. H. Bunke and G. Allerman. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters, 1(4):245-253, 1983.
2. H. Bunke and S. Günter. Weighted mean of a pair of graphs. Computing, 67(3):209-224, 2001.
3. H. Bunke, A. Münger, and X. Jiang. Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem. Pattern Recognition Letters, 20(11-13):1271-1277, 1999.
4. M. Ferrer, F. Serratosa, and A. Sanfeliu. Synthesis of median spectral graph. IbPRIA 2005, volume 3523 of LNCS, pages 139-146. Springer, 2005.
5. A. Hlaoui and S. Wang. Median graph computation for graph clustering. Soft Comput., 10(1):47-53, 2006.
6. X. Jiang, A. M̈unger, and H. Bunke. On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell., 23(10):1144-1151, 2001.
7. A. Münger. Synthesis of prototype graphs from sample graphs. In Diploma Thesis, University of Bern (in German), 1998.
8. K. Riesen, M. Neuhaus, and H. Bunke. Graph embedding in vector spaces by means of prototype selection. GbRPR 2007 Proceedings, volume 4538 of LNCS, pages 383-393. Springer, 2007.
9. A. Schenker, H. Bunke, M. Last, and A. Kandel. Graph-Theoretic Techniques for Web Content Mining. World Scientific Publishing, 2005.
10. E.Weiszfeld. Surle point pour lequel la somme des distances de n points donnés est minimum. Tohoku Math. Journal, (43):355- 386, 1937.