A recursive embedding approach to median graph computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5534 LNCS, Issue , 2009, Pages 113-123

  Ferrer, M ^a   Karatzas, D ^b   Valveny, E ^b   Bunke, H ^c  

^a CSIC   (Spain)

^b Edifici O Campus UAB ^*  (Spain)

^c UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION AND CLUSTERING; GRAPH EMBEDDINGS; GRAPH-BASED; MEDIAN GRAPH; NEW APPROACHES; RECURSIVE ALGORITHMS; VECTOR SPACES;

PATTERN RECOGNITION;

RECURSIVE FUNCTIONS;

EID: 70349845194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02124-4_12     Document Type: Conference Paper

References (15)

1. Schenker, A., Bunke, H., Last, M., Kandel, A.: Graph-Theoretic Techniques for Web Content Mining. World Scientific Publishing, USA (2005)
2. Jiang, X., M̈unger, A., Bunke, H.: On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1144-1151 (2001)
3. M̈unger, A.: Synthesis of prototype graphs from sample graphs. Diploma Thesis, University of Bern (1998) (in German)
4. Hlaoui, A., Wang, S.: Median graph computation for graph clustering. Soft Com-put. 10(1), 47-53 (2006)
5. Ferrer, M., Serratosa, F., Sanfeliu, A.: Synthesis of median spectral graph. In: Marques, J.S., erez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol.3523, pp. 139-146. Springer, Heidelberg (2005)
6. Riesen, K., Neuhaus, M., Bunke, H.: Graph embedding in vector spaces by means of prototype selection. In: Escolano, F., Vento, M. (eds.) GbRPR 2007. LNCS, vol.4538, pp. 383-393. Springer, Heidelberg (2007)
7. Bunke, H., Allerman, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1(4), 245-253 (1983)
8. Bunke, H., G̈unter, S.: Weighted mean of a pair of graphs. Computing 67(3), 209-224 (2001)
9. Ferrer, M., Valveny, E., Serratosa, F., Riesen, K., Bunke, H.: An approximate algorithm for median graph computation using graph embedding. In: Proceedings of 19th ICPR, pp. 287-297 (2008)
10. Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13(3), 353-362 (1983)
11. Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR 2006 and SPR 2006. LNCS, vol.4109, pp. 163-172. Springer, Heidelberg (2006)
12. Riesen, K., Neuhaus, M., Bunke, H.: Bipartite graph matching for computing the edit distance of graphs. In: Escolano, F., Vento, M. (eds.) GbRPR 2007. LNCS, vol.4538, pp. 1-12. Springer, Heidelberg (2007)
13. White, D., Wilson, R.C.: Mixing spectral representations of graphs. In: 18th International Conference on Pattern Recognition (ICPR 2006), Hong Kong, China, August 20-24, pp. 140-144. IEEE Computer Society, Los Alamitos (2006)
14. Weiszfeld, E.: Sur le point pour lequel la somme des distances de n points es est minimum. Tohoku Math. Journal (43), 355-386 (1937)
15. Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: SSPR/SPR, pp. 287-297 (2008)