On learning asymmetric dissimilarity measures

@inproceedings{citeulike:1409098, abstract = {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.}, author = {Kummamuru, K. and Krishnapuram, R. and Agrawal, R. }, citeulike-article-id = {1409098}, journal = {Data Mining, Fifth IEEE International Conference on}, keywords = {learning, metric-learning, toread}, pages = {4 pp.+}, posted-at = {2007-06-24 14:10:04}, priority = {5}, title = {On learning asymmetric dissimilarity measures}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1565760}, year = {2005} }

TY - CONF ID - citeulike:1409098 L3 - citeulike-article-id:1409098 TI - On learning asymmetric dissimilarity measures JF - Data Mining, Fifth IEEE International Conference on SP - 4 pp. N2 - 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. KW - learning KW - metric-learning KW - toread AU - Kummamuru, K AU - Krishnapuram, R AU - Agrawal, R PY - 2005/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1565760 ER -