Improving the speed and stability of the k-nearest neighbors method

Beliakov, Gleb and Li, Gang 2012, Improving the speed and stability of the k-nearest neighbors method, Pattern recognition letters, vol. 33, no. 10, pp. 1296-1301, doi: 10.1016/j.patrec.2012.02.016.

Attached Files
Name Description MIMEType Size Downloads

Title Improving the speed and stability of the k-nearest neighbors method
Author(s) Beliakov, GlebORCID iD for Beliakov, Gleb
Li, GangORCID iD for Li, Gang
Journal name Pattern recognition letters
Volume number 33
Issue number 10
Start page 1296
End page 1301
Total pages 6
Publisher Elsevier BV
Place of publication Amsterdam, Netherlands
Publication date 2012-07-15
ISSN 0167-8655
Keyword(s) Graphics Processing Units
Nearest neighbors
Order statistics
Language eng
DOI 10.1016/j.patrec.2012.02.016
Field of Research 080108 Neural, Evolutionary and Fuzzy Computation
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
Copyright notice ©2012, Elsevier
Persistent URL

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 14 times in TR Web of Science
Scopus Citation Count Cited 20 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 658 Abstract Views, 20 File Downloads  -  Detailed Statistics
Created: Thu, 10 May 2012, 10:01:32 EST by Barb Robertson

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact