Cargando…
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...
Autores principales: | Dashti, Ali, Komarov, Ivan, D’Souza, Roshan M. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2013
|
Materias: | |
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 |
Ejemplares similares
-
Fast k-NNG Construction with GPU-Based Quick Multi-Select
por: Komarov, Ivan, et al.
Publicado: (2014) -
Quantum and Quantum-Inspired Stereographic K Nearest-Neighbour Clustering
por: Viladomat Jasso, Alonso, et al.
Publicado: (2023) -
An Occupancy Mapping Method Based on K-Nearest Neighbours
por: Miao, Yu, et al.
Publicado: (2021) -
Efficient technique of microarray missing data imputation using clustering and weighted nearest neighbour
por: Dubey, Aditya, et al.
Publicado: (2021) -
Phase correlation and clustering of a nearest neighbour coupled oscillators system
por: Ei-Nashar, H F
Publicado: (2002)