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

Pattern Recognition Letters

Volumn 33, Issue 10, 2012, Pages 1296-1301

  Beliakov, Gleb ^a   Li, Gang ^a  

^a DEAKIN UNIVERSITY   (Australia)

Author keywords

Graphics Processing Units; kNN; Nearest neighbors; Order statistics; Selection; Sorting

Indexed keywords

GRAPHICS PROCESSING UNIT; KNN; NEAREST NEIGHBORS; ORDER STATISTICS; SELECTION;

COMPUTER GRAPHICS; SORTING;

PROGRAM PROCESSORS;

EID: 84860223796     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2012.02.016     Document Type: Article

References (31)

1. Arya, S.; Mount, D.M.; 1993. Approximate nearest neighbor searching. In: Proc. 4th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pp. 271-280.
2. S. Arya, T. Malamatos, and D.M. Mount Space-time tradeoffs for approximate nearest neighbor searching Journal of the ACM 57 2009 1 54
3. R.J. Barrientos, J.I. Gómez, C. Tenllado, M. Prieto, and M. Marin kNN query processing in metric spaces using GPUs Proceedings of the 17th international conference on Parallel processing - Volume Part I 2011 Springer-Verlag Berlin, Heidelberg 380 392
4. Barrientos, R.J.; Gomez, J.I.; Tenllado, C.; Prieto, M.; 2010. Heap based k-nearest neighbor searh on GPUs. In: Congreso Espanol de Informatica, Valencia, Spain, pp.559-566.
5. Beliakov, G.; 2011. Parallel calculation of the median and order statistics on GPUs with application to robust regression. Technical report, arXiv:1104.2732.
6. G. Beliakov, M. Johnstone, and S. Nahavandi Computing of high breakdown regression estimators without sorting on graphics processing units Computing 2012 10.1007/s00607-011-0183-7
7. D. Cederman, and P. Tsigas GPU-Quicksort: A practical quicksort algorithm for graphics processors ACM Journal of Experimental Algorithmics 14 2009 1.4.1 1.4.2
8. L. Chen, and X. Lian Efficient similarity search in nonmetric spaces with local constant embedding IEEE Transactions on Knowledge and Data Engineering 20 3 2008 321 336 (Pubitemid 351185383)
9. D.-A. Chiang, Y.-H. Wang, and S.-P. Chen Analysis on repeat-buying patterns Knowledge-Based Systems 23 2010 757 768
10. T. Cover, and P. Hart Nearest neighbor pattern classification IEEE Transactions on Information Theory 13 1967 21 27
11. A. Djouadi, and E. Bouktache A fast algorithm for the nearest-neighbor classifier IEEE Transactions on Pattern Analysis and Machine Intelligence 19 1997 277 282
12. A. Farago, T. Linder, and G. Lugosi Fast nearest-neighbor search in dissimilarity spaces IEEE Transactions on Pattern Analysis and Machine Intelligence 15 1993 957 962 (Pubitemid 23703599)
13. Garcia, V.; Debreuve, E.; Barlaud, M. 2008. Fast k nearest neighbor search using GPU. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2008, CVPRW '08.; pp. 1-6.
14. K. Goh, B. Li, and E. Chang DynDex: A Dynamic and Non-metric Space Indexer ACM Multimedia 2002 ACM 466 475
15. Hoberock, J.; Bell, N.; 2010. Thrust: A parallel template library, , Version 1.3.0.
16. A. Irpino, and V. Tontodonato Clustering reduced interval data using hausdorff distance Computational Statistics 21 2006 271 288 (Pubitemid 44604003)
17. D.W. Jacobs, D. Weinshall, and Y. Gdalyahu Classification with nonmetric distances: image retrieval and class representation IEEE Transactions on Pattern Analysis and Machine Intelligence 22 2000 583 600
18. Kato, K.; Hosino, T.; 2010. Solving k-nearest neighbor problem on multiple graphics processors. In: IEEE International Symposium on Cluster Computing and the Grid, pp. 769-773.
19. Leischner, N.; Osipov, V.; Sanders, P.; 2010. GPU samplesort. In: IEEE International Parallel and Distributed Processing Symposium, Atlanta, IEEE, doi:10.1109/IPDPS.2010.5470444.
20. H. Luo, C. Niu, R. Shen, and C. Ullrich A collaborative filtering framework based on both local user similarity and global user similarity Machine Learning 72 2008 231 245
21. Merrill, D.; Grimshaw, A.; 2010. Revisiting sorting for GPGPU stream architectures. Technical Report CS2010-03, University of Virginia, Department of Computer Science, Charlottesville, VA, USA.
22. Mount, D.M.; 2011. ANN: a library for approximate nearest neighbor searching, .
23. A.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery Numerical Recipes in C: The Art of Scientific Computing 2002 Cambridge University Press New York
24. S. Santini, and R. Jain Similarity measures IEEE Transactions on Pattern Analysis and Machine Intelligence 21 1999 871 883 (Pubitemid 30532488)
25. Satish, N.; Harris, M.; Garland, M.; 2009. Designing efficient sorting algorithms for manycore GPUs. In: Proc. of IEEE Intl Parallel and Distributed Processing Symposium 2009 (IPDPS 2009).
26. R. Sedgewick Algorithms 2nd ed. 1988 Addison-Wesley Reading, MA
27. I.K. Sethi A fast algorithm for recognizing nearest neighbors IEEE Transactions on Systems, Man, and Cybernetics 11 1981 245 249
28. G. Shakhnarovich, T. Darrell, and P. Indyk Nearest-Neighbor Methods in Learning and Vision: Theory and Practice 2006 MIT Press Cambridge, MA
29. E. Sintorn, and U. Assarsson Fast parallel GPU-sorting using a hybrid algorithm Journal of Parallel and Distributed Computing 68 2008 1381 1388
30. Tversky, A.; 1977. Features of similarity. Psychological Review 84, 327-352.
31. X. Wu, V. Kumar, J.R. Quinlan, J. Ghosh, Q. Yang, H. Motoda, G.J. McLachlan, A. Ng, B. Liu, P.S. Yu, Z.-H. Zhou, M. Steinbach, D.J. Hand, and D. Steinberg Top 10 algorithms in data mining Knowl. Inf. Syst. 14 2007 1 37