Non-Euclidean Dissimilarities: Causes and Informativeness

In the process of designing pattern recognition systems one may choose a representation based on pairwise dissimilarities between objects. This is especially appealing when a set of discriminative features is difficult to find. Various classification systems have been studied for such a dissimilarity representation: the direct use of the nearest neighbor rule, the postulation of a dissimilarity space and an embedding to a virtual, underlying feature vector space. It appears in several applications that the dissimilarity measures constructed by experts tend to have a non-Euclidean behavior. In this paper we first analyze the causes of such choices and then experimentally verify that the non-Euclidean property of the measure can be informative.

[1]  N. JARDINE,et al.  A New Approach to Pattern Recognition , 1971, Nature.

[2]  Azriel Rosenfeld,et al.  Progress in pattern recognition , 1985 .

[3]  Horst Bunke,et al.  Applications of approximate string matching to 2D shape recognition , 1993, Pattern Recognit..

[4]  Anil K. Jain,et al.  A modified Hausdorff distance for object matching , 1994, Proceedings of 12th International Conference on Pattern Recognition.

[5]  Robert P. W. Duin,et al.  Experiments with a featureless approach to pattern recognition , 1997, Pattern Recognit. Lett..

[6]  Anil K. Jain,et al.  Representation and Recognition of Handwritten Digits Using Deformable Templates , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[8]  Klaus Obermayer,et al.  Classi cation on Pairwise Proximity , 2007 .

[9]  R. C. Williamson,et al.  Classification on proximity data with LP-machines , 1999 .

[10]  Shimon Edelman,et al.  Representation and recognition in vision , 1999 .

[11]  Daphna Weinshall,et al.  Classification with Nonmetric Distances: Image Retrieval and Class Representation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Robert P. W. Duin,et al.  A Generalized Kernel Approach to Dissimilarity-based Classification , 2002, J. Mach. Learn. Res..

[13]  Tony Jebara,et al.  A Kernel Between Sets of Vectors , 2003, ICML.

[14]  Oleg Golubitsky,et al.  What is a Structural Representation? (Second Version) , 2004 .

[15]  R. Duin.  Structural class representation and pattern recognition by ETS ; a commentary * , 2004 .

[16]  Robert P. W. Duin,et al.  The Dissimilarity Representation for Pattern Recognition - Foundations and Applications , 2005, Series in Machine Perception and Artificial Intelligence.

[17]  Horst Bunke,et al.  Non-Euclidean or Non-metric Measures Can Be Informative , 2006, SSPR/SPR.

[18]  Robert P. W. Duin,et al.  Prototype selection for dissimilarity-based classifiers , 2006, Pattern Recognit..

[19]  Wan-Jui Lee,et al.  On Euclidean Corrections for Non-Euclidean Dissimilarities , 2008, SSPR/SPR.

[20]  R. Duin,et al.  The dissimilarity representation for pattern recognition , a tutorial , 2009 .