Fast k-NNG construction with GPU-based quick multi-select
Dept. of Mechanical Engineering, Complex Systems Simulation Lab, University of Wisconsin-Milwaukee, Milwaukee, WI, USA
arXiv:1309.5478 [cs.DC], (21 Sep 2013)
@article{2013arXiv1309.5478K,
author={Komarov}, I. and {Dashti}, A. and {D’Souza}, R.},
title={"{Fast $k$-NNG construction with GPU-based quick multi-select}"},
journal={ArXiv e-prints},
archivePrefix={"arXiv"},
eprint={1309.5478},
primaryClass={"cs.DC"},
keywords={Computer Science – Distributed, Parallel, and Cluster Computing},
year={2013},
month={sep},
adsurl={http://adsabs.harvard.edu/abs/2013arXiv1309.5478K},
adsnote={Provided by the SAO/NASA Astrophysics Data System}
}
In this paper we describe a new brute force algorithm for building the k-Nearest Neighbor Graph (k-NNG). The k-NNG algorithm has many applications in areas such as machine learning, bioinformatics, and clustering analysis. While there are very efficient algorithms for data of low dimensions, for high dimensional data the brute force search is the best algorithm. There are two main parts to the algorithm: the first part is finding the distances between the input vectors which may be formulated as a matrix multiplication problem. The second is the selection of the k-NNs for each of the query vectors. For the second part, we describe a novel graphics processing unit (GPU) -based multi-select algorithm based on quick sort. Our optimization makes clever use of warp voting functions available on the latest GPUs along with use-controlled cache. Benchmarks show significant improvement over state-of-the-art implementations of the k-NN search on GPUs.
September 25, 2013 by hgpu
