Learning Local Invariant Mahalanobis Distances
For many tasks and data types, there are natural transformations to which the data should be invariant or insensitive. For instance, in visual recognition, natural images should be insensitive to rotation and translation. This requirement and its implications have been important in many machine learning applications, and tolerance for image transformations was primarily achieved by using robust feature vectors. In this paper we propose a novel and computationally efficient way to learn a local Mahalanobis metric per datum, and show how we can learn a local invariant metric to any transformation in order to improve performance.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningTranslationSimilar Papers 제목 키워드 기반
Classification Using Global and Local Mahalanobis Distances
We propose a novel semiparametric classifier based on Mahalanobis distances of an observation from the competing classes. Our tool is a generalized additive model with the logistic link function that uses these distances…
ClassificationLipschitz Continuity of Mahalanobis Distances and Bilinear Forms
Many theoretical results in the machine learning domain stand only for functions that are Lipschitz continuous. Lipschitz continuity is a strong form of continuity that linearly bounds the variations of a function. In th…
BIG-bench Machine LearningmetricDTW: local distance metric learning in Dynamic Time Warping
We propose to learn multiple local Mahalanobis distance metrics to perform k-nearest neighbor (kNN) classification of temporal sequences. Temporal sequences are first aligned by dynamic time warping (DTW); given the alig…
Dynamic Time WarpingGeneral ClassificationMetric LearningTemporal Sequences+2Online Adaptive Mahalanobis Distance Estimation
Mahalanobis metrics are widely used in machine learning in conjunction with methods like $k$-nearest neighbors, $k$-means clustering, and $k$-medians clustering. Despite their importance, there has not been any prior wor…
ClusteringDimensionality ReductionLarge Margin Nearest Neighbor Classification using Curved Mahalanobis Distances
We consider the supervised classification problem of machine learning in Cayley-Klein projective geometries: We show how to learn a curved Mahalanobis metric distance corresponding to either the hyperbolic geometry or th…
BIG-bench Machine LearningClassificationGeneral Classification