Skip navigation
Skip navigation
The system will be down for maintenance between 8:00 and 8:15am on Wednesday 12, December 2018

Efficiently learning a distance metric for large margin nearest neighbor classification

Park, Kyoungup; Shen, Chunhua; Hao, Zhihui; Kim, Junae

Description

We concern the problem of learning a Mahalanobis distance metric for improving nearest neighbor classification. Our work is built upon the large margin nearest neighbor (LMNN) classification framework. Due to the semidefiniteness constraint in the optimization problem of LMNN, it is not scalable in terms of the dimensionality of the input data. The original LMNN solver partially alleviates this problem by adopting alternating projection methods instead of standard interior-point methods. Still,...[Show more]

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
URI: http://hdl.handle.net/1885/33692
Source: Proceedings of AAAI 2011

Download

File Description SizeFormat Image
01_Park_Efficiently_learning_a_2011.pdf533.17 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator