On Lipschitz embeddings of graphs

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

Volumn 5177 LNAI, Issue PART 1, 2008, Pages 131-140

  Riesen, Kaspar ^a   Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; EMBEDDINGS; GRAPHIC METHODS; KNOWLEDGE BASED SYSTEMS; PATTERN RECOGNITION;

CLASSIFICATION AND CLUSTERING; CLASSIFICATION SYSTEM; EMBEDDED GRAPHS; EXPERIMENTAL EVALUATION; FEATURE VECTORS; GRAPH DISTANCES; GRAPH EMBEDDINGS; GRAPH-BASED REPRESENTATIONS;

GRAPH ALGORITHMS;

EID: 57849155394     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85563-7_22     Document Type: Conference Paper

References (15)

1. Duda, R., Hart, P., Stork, D.: Pattern Classification, 2nd edn. Wiley-Interscience, Chichester (2000)
2. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Artificial Intelligence 18(3), 265-298 (2004)
3. Gartner, T.: A survey of kernels for structured data. SIGKDD Explorations 5(1), 49-58 (2003)
4. Bourgain, J.: On Lipschitz embedding of finite metric spaces in Hubert spaces. Israel Journal of Mathematics 52(1-2), 46-52 (1985)
5. Riesen, K., Neuhaus, M., Bunke, H.: Graph embedding in vector spaces by means of prototype selection. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol. 4538, pp. 383-393. Springer, Heidelberg (2007)
6. Duin, R., Pekalska, E.: The Dissimilarity Representations for Pattern Recognition: Foundations and Applications. World Scientific, Singapore (2005)
7. Hjaltason, G., Samet, H.: Properties of embedding methods for similarity searching in metric spaces. IEEE Trans. on Pattern Analysis ans Machine Intelligence 25(5), 530-549 (2003)
8. Bunke, H., Allermann, C.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1, 245-253 (1983)
9. Riesen, K., Neuhaus, M., Bunke, H.: Bipartite graph matching for computing the edit distance of graphs. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol. 4538, pp. 1-12. Springer, Heidelberg (2007)
10. Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 215-245 (1995)
11. Kaufman, L., Rousseeuw, P.: Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, Chichester (1990)
12. Nene, S., Nayar, S., Murase, H.: Columbia Object Image Library: Coil-100. Technical report, Department of Computer Science, Columbia University, New York (1996)
13. Watson, C., Wilson, C.: NIST Special Database 4, Fingerprint Database. National Institute of Standards and Technology (1992)
14. DTP, D.T.P.: AIDS antiviral screen (2004), http://dtp.nci.nih.gov/docs/ aids/aids-data.html
15. Schenker, A., Bunke, H., Last, M., Kandel, A.: Graph-Theoretic Techniques for Web Content Mining. World Scientific, Singapore (2005)