Change search
ReferencesLink to record
Permanent link

Direct link
Learning Distance Functions in k-Nearest Neighbors
Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, Department of Computer and Information Science.
2013 (English)MasteroppgaveStudent thesis
Abstract [en]

Normally the distance function used in classification in the k-Nearest Neighbors algorithm is the euclidean distance. This distance function is simple and has been shown to work on many different datasets. We propose a approach where we use multiple distance functions, one for each class, to classify the input data. To learn multiple distance functions we propose a new distance function with two learning algorithms. We show by experiments that the distance functions that we learn yields better classification accuracy than the euclidean distance, and that multiple distance functions can classify better than one.

Place, publisher, year, edition, pages
Institutt for datateknikk og informasjonsvitenskap , 2013. , 61 p.
URN: urn:nbn:no:ntnu:diva-20865Local ID: ntnudaim:6957OAI: diva2:621995
Available from: 2013-05-19 Created: 2013-05-19 Last updated: 2013-06-22Bibliographically approved

Open Access in DiVA

fulltext(651 kB)381 downloads
File information
File name FULLTEXT01.pdfFile size 651 kBChecksum SHA-512
Type fulltextMimetype application/pdf
cover(193 kB)20 downloads
File information
File name COVER01.pdfFile size 193 kBChecksum SHA-512
Type coverMimetype application/pdf

By organisation
Department of Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 381 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link