Efficient Computation of k-Nearest Neighbour Graphs for Large High-Dimensional Data Sets on GPU Clusters

This paper presents an implementation of the brute-force exact k-Nearest Neighbor Graph (k-NNG) construction for ultra-large high-dimensional data cloud. The proposed method uses Graphics Processing Units (GPUs) and is scalable with multi-levels of parallelism (between nodes of a cluster, between di...

Descripción completa

Detalles Bibliográficos
Autores principales: Dashti, Ali, Komarov, Ivan, D’Souza, Roshan M.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2013
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3781071/
https://www.ncbi.nlm.nih.gov/pubmed/24086314
http://dx.doi.org/10.1371/journal.pone.0074113

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3781071/
https://www.ncbi.nlm.nih.gov/pubmed/24086314
http://dx.doi.org/10.1371/journal.pone.0074113

Ejemplares similares