On Not Making Dissimilarities Euclidean
暂无分享,去创建一个
Horst Bunke | Robert P. W. Duin | Simon Günter | Elzbieta Pekalska | H. Bunke | R. Duin | E. Pekalska | S. Günter | Simon Günter
[1] C. K. Chow,et al. On optimum recognition error and reject tradeoff , 1970, IEEE Trans. Inf. Theory.
[2] N. JARDINE,et al. A New Approach to Pattern Recognition , 1971, Nature.
[3] Gerald W. Kimble,et al. Information and Computer Science , 1975 .
[4] Azriel Rosenfeld,et al. Progress in pattern recognition , 1985 .
[5] J. Gower,et al. Metric and Euclidean properties of dissimilarity coefficients , 1986 .
[6] Anil K. Jain,et al. A modified Hausdorff distance for object matching , 1994, Proceedings of 12th International Conference on Pattern Recognition.
[7] Anil K. Jain,et al. Representation and Recognition of Handwritten Digits Using Deformable Templates , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[8] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .
[9] Daphna Weinshall,et al. Classification with Nonmetric Distances: Image Retrieval and Class Representation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..
[10] Robert P. W. Duin,et al. A Generalized Kernel Approach to Dissimilarity-based Classification , 2002, J. Mach. Learn. Res..
[11] Horst Bunke,et al. Towards Bridging the Gap between Statistical and Structural Pattern Recognition: Two New Concepts in Graph Matching , 2001, ICAPR.
[12] Sameer Singh,et al. Advances in Pattern Recognition — ICAPR 2001 , 2001, Lecture Notes in Computer Science.
[13] Robert P. W. Duin,et al. Dissimilarity representations allow for building good classifiers , 2002, Pattern Recognit. Lett..
[14] Joachim M. Buhmann,et al. Going Metric: Denoising Pairwise Data , 2002, NIPS.
[15] Pierre Courrieu,et al. Straight monotonic embedding of data sets in Euclidean spaces , 2002, Neural Networks.
[16] Luisa Micó,et al. A modification of the LAESA algorithm for approximated k-NN classification , 2003, Pattern Recognit. Lett..