Synonyms
Adaptive metric techniques; Flexible metric computation
Definition
Many problems in data mining (e.g., classification, clustering, information retrieval) are concerned with the discovery of homogeneous groups of data according to a certain similarity (or distance) measure. The distance measure in use strongly affects the nature of the patterns (clusters, classes, or retrieved images) emerging from the given data. Typically, any chosen fixed distance measure, such as Euclidean or Manhattan distance, does not capture the underlying structure of the data, and fails to find meaningful patterns which correspond to the user’s preferences. To address this issue, techniques have been developed that learn from the data how to compute dissimilarities between pairs of objects. Since objects are commonly represented as vectors of measurements in a given feature space, distances between two objects are computed in terms of the dissimilarity between their corresponding feature components....
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Bellman R. Adaptive control processes: Princeton University Press; 1961.
Blansch A, Ganarski P, Korczak J. Maclaw: a modular approach for clustering with local attribute weighting. Pattern Recognit Lett. 2006; 27(11):1299–1306.
Domeniconi C, Gunopulos D, Peng J. Large margin nearest neighbor classifiers. IEEE Trans Neural Netw. 2005;16(4):899–909.
Domeniconi C, Gunopulos D, Yan S, Ma B, Al-Razgan M, Papadopoulos D. Locally adaptive metrics for clustering high dimensional data. Data Mining Knowl Discov J. 2007;14(1):63–97.
Domeniconi C, Peng J, Gunopulos D. Locally adaptive metric nearest neighbor classification. IEEE Trans Pattern Anal Mach Intell. 2002; 24(9):1281–85.
Friedman J. Flexible metric nearest neighbor classification. In: Technical Report, Department of Statistics, Stanford University, 1994.
Friedman J, Meulman J. Clustering objects on subsets of attributes. Technical Report, Stanford University, 2002.
Frigui H, Nasraoui O. Unsupervised learning of prototypes and attribute weights. Pattern Recognit. 2004; 37(3):943–52.
Hartigan JA. Direct clustering of a data matrix. J Am Stat Assoc. 1972; 67(337):123–9.
Hastie T, Tibshirani R. Discriminant adaptive nearest neighbor classification. IEEE Trans Pattern Anal Machine Intell. 1996; 18(6):607–15.
Jain A, Mutty M, Flyn P. Data clustering: a review. ACM Comput Surv. 1999; 31(3).
Modha D. and Spangler S.. Feature weighting in K-means clustering. Mach Learn. 2003; 52(3):217–37.
Shawe-Taylor J, Pietzuch FN. Kernel methods for pattern analysis. London: Cambridge University Press; 2004.
Xing E, Ng A, Jordan M, Russell S. Distance metric learning, with application to clustering with side-information. In: Advances in Neural Information Processing Systems, vol. 15. Cambridge: MIT Press; 2003.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Domeniconi, C. (2018). Learning Distance Measures. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_614
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_614
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering