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

DOI10.1016/J.JPDC.2006.10.004MaRDI QIDQ869400zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

\textit{k}nn graphsapproximate nearest neighborsdistributed algorithmsmetric spacesnearest neighborsrange queriesrobotics

Mathematics Subject Classification ID

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

Recommendations

• Fast approximate kNN 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

Cited in

(4)

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

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)