Journal
ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS, AIAI 2022, PART II
Volume 647, Issue -, Pages 112-123Publisher
SPRINGER INTERNATIONAL PUBLISHING AG
DOI: 10.1007/978-3-031-08337-2_10
Keywords
Nearest neighbors; GPU; CPU; Exact; Hybrid; k-NN
Ask authors/readers for more resources
This paper proposes a hybrid algorithm for exact nearest neighbors queries in high-dimensional spaces. By efficiently splitting the computational load between CPU and GPU, our method improves upon previous approaches for high-dimensional datasets, achieving linear scalability with the dimensionality of the data.
In this paper, we propose a hybrid algorithm for exact nearest neighbors queries in high-dimensional spaces. Indexing structures typically used for exact nearest neighbors search become less efficient in high-dimensional spaces, effectively requiring brute-force search. Our method uses a massively-parallel approach to brute-force search that efficiently splits the computational load between CPU and GPU. We show that the performance of our algorithm scales linearly with the dimensionality of the data, improving upon previous approaches for high-dimensional datasets. The algorithm is implemented in Julia, a high-level programming language for numerical and scientific computing. It is openly available at https://github.com/davnn/ParallelNeighbors.jl.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available