DocumentCode :
2006339
Title :
Regularized Minimum Volume Ellipsoid Metric for Query-Based Learning
Author :
Abou-Moustafa, Karim ; Ferrie, Frank
Author_Institution :
Artificial Perception Lab., McGill Univ., Montreal, QC, Canada
fYear :
2008
fDate :
11-13 Dec. 2008
Firstpage :
188
Lastpage :
193
Abstract :
We are interested in learning an adaptive local metric on a lower dimensional manifold for query--based operations.We combine the concept underlying manifold learning algorithms and the minimum volume ellipsoid metric to find the nearest neighbouring points to a query point on the manifold on which the query point is lying. Extensive experiments on various standard benchmark data sets in the context of classification showed very promising results when compared to state of the art metric learning algorithms.
Keywords :
learning (artificial intelligence); query processing; art metric learning algorithms; manifold learning algorithms; query-based learning; regularized minimum volume ellipsoid metric; Ellipsoids; Euclidean distance; Laboratories; Machine learning; Machine learning algorithms; Manifolds; Nearest neighbor searches; Noise measurement; Pattern recognition; Symmetric matrices; manifold learning; metric learning; minimum volume ellipsoid;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Applications, 2008. ICMLA '08. Seventh International Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
978-0-7695-3495-4
Type :
conf
DOI :
10.1109/ICMLA.2008.32
Filename :
4724974
Link To Document :
بازگشت