Distributed computation of the \textit{k}nn graph for large high-dimensional point sets

DOI10.1016/J.JPDC.2006.10.004zbMATH Open1112.68121DBLPjournals/jpdc/PlakuK07OpenAlexW2157057296WikidataQ42210805 ScholiaQ42210805MaRDI QIDQ869400FDOQ869400

Authors: Erion Plaku, Lydia E. Kavraki 

Publication date: 2 March 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.10.004

Recommendations

• Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
• Parallel algorithms for nearest neighbor search problems in high dimensions
• On nearest-neighbor graphs
• On nearest-neighbor graphs

zbMATH Keywords

nearest neighborsmetric spacesdistributed algorithmsroboticsrange queries\textit{k}nn graphsapproximate nearest neighbors

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (4)

• Distributed Point Functions and Their Applications
• Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
• Graph-based time-space trade-offs for approximate near neighbors
• Constructing a high-dimensional \(k\)NN-graph using a Z-order curve

This page was built for publication: Distributed computation of the \textit{k}nn graph for large high-dimensional point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869400)