Deakin home > Deakin University Library > Deakin Research Online > Improving the speed and stability of the k-nearest neighbors method

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.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads

Title Improving the speed and stability of the k-nearest neighbors method
Author(s) Beliakov, Gleb
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
1872-7344
Keyword(s) Graphics Processing Units
kNN
Nearest neighbors
Order statistics
Selection
Sorting
Language eng
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 B.V. All rights reserved.
Persistent URL http://hdl.handle.net/10536/DRO/DU:30045078

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 1 times in Scopus
Access Statistics: 34 Abstract Views, 5 File Downloads  -  Detailed Statistics
Created: Thu, 10 May 2012, 10:01:32 EST by Barb Robertson