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

Open Access

Peer-reviewed

Research Article

Ali Dashti,

Affiliation Department of Mechanical Engineering, Complex Systems Simulation Lab, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin, United States of America
⨯
Ivan Komarov,

Affiliation Department of Mechanical Engineering, Complex Systems Simulation Lab, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin, United States of America
⨯
Roshan M. D’Souza

* E-mail: dsouza@uwm.edu

Affiliation Department of Mechanical Engineering, Complex Systems Simulation Lab, University of Wisconsin-Milwaukee, Milwaukee, Wisconsin, United States of America
⨯

Reader Comments (0)

Graphs
Is the Subject Area "Graphs" applicable to this article?

Thanks for your feedback.
Algorithms
Is the Subject Area "Algorithms" applicable to this article?

Thanks for your feedback.
Diffraction
Is the Subject Area "Diffraction" applicable to this article?

Thanks for your feedback.
Machine learning algorithms
Is the Subject Area "Machine learning algorithms" applicable to this article?

Thanks for your feedback.
Computing methods
Is the Subject Area "Computing methods" applicable to this article?

Thanks for your feedback.
Data processing
Is the Subject Area "Data processing" applicable to this article?

Thanks for your feedback.
Machine learning
Is the Subject Area "Machine learning" applicable to this article?

Thanks for your feedback.
Vector spaces
Is the Subject Area "Vector spaces" applicable to this article?

Thanks for your feedback.