Generalized median graph computation by means of graph embedding in vector spaces

Pattern Recognition

Volumn 43, Issue 4, 2010, Pages 1642-1655

  Ferrer, M ^a   Valveny, E ^a   Serratosa, F ^b   Riesen, K ^c   Bunke, H ^c  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^c UNIVERSITY OF BERN   (Switzerland)

Author keywords

Graph embedding; Graph matching; Median graph; Vector spaces; Weighted mean of graphs

Indexed keywords

CLASSIFICATION TASKS; COMPLEX MACHINES; GRAPH EMBEDDINGS; GRAPH MATCHINGS; LARGE GRAPHS; MEDIAN GRAPH; NEW APPROACHES; WEIGHTED MEAN;

LEARNING ALGORITHMS; PATTERN MATCHING; VECTORS;

VECTOR SPACES;

EID: 74449085626     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2009.10.013     Document Type: Article

References (31)

1. Development Therapeutics Program DTP. AIDS Antiviral Screen, 2004 〈http://dtp.nci.nih.gov/docs/aids/aids_data.html〉.
2. Bajaj C. The algebraic degree of geometric optimization problems. Discrete Comput. Geom. 3 2 (1988) 177-191
3. Bunke H., and Allerman G. Inexact graph matching for structural pattern recognition. Pattern Recognition Lett. 1 4 (1983) 245-253
4. Bunke H., and Günter S. Weighted mean of a pair of graphs. Computing 67 3 (2001) 209-224
5. Conte D., Foggia P., Sansone C., and Vento M. Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognition Artif. Intell. 18 3 (2004) 265-298
6. de la Higuera C., and Casacuberta F. Topology of strings: median string is NP-complete. Theor. Comput. Sci. 230 1-2 (2000) 39-48
7. Demirci M.F., Shokoufandeh A., Keselman Y., Bretzner L., and Dickinson S.J. Object recognition as many-to-many feature matching. Int. J. Comput. Vision 69 2 (2006) 203-222
8. Dosch P., and Valveny E. Report on the second symbol recognition contest. In: Liu W., and Lladós J. (Eds). GREC, Lecture Notes in Computer Science vol. 3926 (2005), Springer, Berlin
9. Duda R., Hart P., and Stork D. Pattern Classification. second ed. (2000), Wiley Interscience
10. Ferrer M., Serratosa F., and Sanfeliu A. Synthesis of median spectral graph. Second Iberian Conference of Pattern Recognition and Image Analysis, Lecture Notes in Computer Science vol. 3523 (2005), Springer, Berlin
11. Friedman M., and Kandel A. Introduction to Pattern Recognition (1999), World Scientific, Singapore
12. K. Grauman, T. Darrell, Fast contour matching using approximate earth mover's distance, in: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004.
13. Hakimi S.L. Location Theory (2000), CRC Press, Boca Raton, FL
14. Hlaoui A., and Wang S. Median graph computation for graph clustering. Soft Comput. 10 1 (2006) 47-53
15. P. Indyk, Algorithmic applications of low-distortion geometric embeddings, in: IEEE Symposium on Foundations of Computer Science, 2001.
16. Jiang X., Münger A., and Bunke H. On median graphs: properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 23 10 (2001) 1144-1151
17. Justice D., and Hero A.O. A binary linear programming formulation of the graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 28 8 (2006) 1200-1214
18. Luo B., Wilson R.C., and Hancock E.R. Spectral embedding of graphs. Pattern Recognition 36 10 (2003) 2213-2230
19. A. Münger, Synthesis of prototype graphs from sample graphs, Diploma Thesis, University of Bern, 1998 (in German).
20. Neuhaus M., and Bunke H. An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification. In: Fred A.L.N., Caelli T., Duin R.P.W., Campilho A.C., and de Ridder D. (Eds). SSPR/SPR, Lecture Notes in Computer Science vol. 3138 (2004), Springer, Berlin
21. Neuhaus M., Riesen K., and Bunke H. Fast suboptimal algorithms for the computation of graph edit distance. Joint IAPR International Workshops, SSPR and SPR 2006, Lecture Notes in Computer Science vol. 4109 (2006), Springer, Berlin
22. Pekalska E., Duin R.P.W., and Paclík P. Prototype selection for dissimilarity-based classifiers. Pattern Recognition 39 2 (2006) 189-208
23. K. Riesen, H. Bunke, IAM graph database repository for graph based pattern recognition and machine learning, in: SSPR/SPR, 2008.
24. Riesen K., and Bunke H. Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput. 27 7 (2009) 950-959
25. Riesen K., Neuhaus M., and Bunke H. Graph embedding in vector spaces by means of prototype selection. Sixth IAPR-TC-15 International Workshop, GbRPR 2007, Lecture Notes in Computer Science vol. 4538 (2007), Springer, Berlin
26. Robles-Kelly A., and Hancock E.R. A Riemannian approach to graph embedding. Pattern Recognition 40 3 (2007) 1042-1056
27. Sanfeliu A., and Fu K. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13 3 (1983) 353-362
28. Schenker A., Bunke H., Last M., and Kandel A. Graph-Theoretic Techniques for Web Content Mining (2005), World Scientific Publishing Co., Inc., USA
29. Weiszfeld E. Sur le point pour lequel la somme des distances de n points donnés est minimum. Tohoku Math. J. 43 (1937) 355-386
30. D. White, R.C. Wilson, Mixing spectral representations of graphs, in: 18th International Conference on Pattern Recognition (ICPR 2006), Hong Kong, China, IEEE Computer Society, 20-24 August 2006.
31. Wilson R.C., Hancock E.R., and Luo B. Pattern vectors from algebraic graph theory. IEEE Trans. Pattern Anal. Mach. Intell. 27 7 (2005) 1112-1124