loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE International Conference on Data Mining (ICDM'05)
On Learning Asymmetric Dissimilarity Measures
Houston, Texas
November 27-November 30
ISBN: 0-7695-2278-5
Krishna Kummamuru, IBM India Research Lab
Raghu Krishnapuram, IBM India Research Lab
Rakesh Agrawal, IBM Almaden Research Center
Many practical applications require that distance measures to be asymmetric and context-sensitive. We introduce Context-sensitive Learnable Asymmetric Dissimilarity (CLAD) measures, which are defined to be a weighted sum of a fixed number of dissimilarity measures where the associated weights depend on the point from which the dissimilarity is measured. The parameters used in defining the measure capture the global relationships among the features. We provide an algorithm to learn the dissimilarity measure automatically from a set of user specified comparisons in the form "x is closer to y than to z," and study its performance. The experimental results show that the proposed algorithm outperforms other approaches due to the context sensitive nature of the CLAD measures.
Citation:
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agrawal, "On Learning Asymmetric Dissimilarity Measures," icdm, pp.697-700, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.