On Lipschitz Embeddings of Graphs
暂无分享,去创建一个
[1] Thomas Gärtner,et al. A survey of kernels for structured data , 2003, SKDD.
[2] David G. Stork,et al. Pattern Classification (2nd ed.) , 1999 .
[3] Kaspar Riesen,et al. Bipartite Graph Matching for Computing the Edit Distance of Graphs , 2007, GbRPR.
[4] Abraham Kandel,et al. Graph-Theoretic Techniques for Web Content Mining , 2005, Series in Machine Perception and Artificial Intelligence.
[5] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[6] Mario Vento,et al. Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..
[7] Kaspar Riesen,et al. Graph Embedding in Vector Spaces by Means of Prototype Selection , 2007, GbRPR.
[8] Hanan Samet,et al. Properties of Embedding Methods for Similarity Searching in Metric Spaces , 2003, IEEE Trans. Pattern Anal. Mach. Intell..
[9] Sameer A. Nene,et al. Columbia Object Image Library (COIL100) , 1996 .
[10] David G. Stork,et al. Pattern Classification , 1973 .
[11] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .
[12] Horst Bunke,et al. Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..
[13] Robert P. W. Duin,et al. The Dissimilarity Representation for Pattern Recognition - Foundations and Applications , 2005, Series in Machine Perception and Artificial Intelligence.