Parallel algorithms for nearest neighbor search problems in high dimensions

DOI10.1137/15M1026377MaRDI QIDQ2830635zbMATH OpenFDO

Authors Bo Xiao, George Biros

Publication date 28 October 2016

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

machine learningdata analysiscomputational statisticsparallel algorithmstree codesnearest neighbor algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Parallel computation in finding near neighbourhoods
• Approximate nearest neighbor search in high dimensions
• scientific article; zbMATH DE number 811530
• scientific article; zbMATH DE number 1559575
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• scientific article; zbMATH DE number 1775451
• Nearest neighbor search algorithm and its parallel implementation in the SPH method

Cites work

• scientific article; zbMATH DE number 4078838 (Why is no real title available?)
• scientific article; zbMATH DE number 5485566 (Why is no real title available?)
• scientific article; zbMATH DE number 6276253 (Why is no real title available?)
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• A non-linear dimension reduction methodology for generating data-driven stochastic input models
• ASKIT: approximate skeletonization kernel-independent treecode in high dimensions
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Finding nearest neighbors in growth-restricted metrics
• Foundations of multidimensional and metric data structures.
• Gaussian processes for machine learning.
• Parallel Processing for Scientific Computing
• Satisfying general proximity/similarity queries with metric trees
• Separators for sphere-packings and nearest neighbor graphs
• The effectiveness of Lloyd-type methods for the \(k\)-means problem
• The elements of statistical learning. Data mining, inference, and prediction

Cited in

(6)

• Concurrent linearizable nearest neighbour search in LockFree-kD-tree
• New algorithms for efficient high-dimensional nonparametric classification
• Distributed computation of the \textit{k}nn graph for large high-dimensional point sets
• Training very large scale nonlinear SVMs using alternating direction method of multipliers coupled with the hierarchically semi-separable kernel approximations
• Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases
• Parallel nearest neighbors in low dimensions with batch updates

Describes a project that uses

Uses Software

• HykSort
• E2LSH
• ASKIT
• FLANN
• ANN
• MLPACK
• UCI

This page was built for publication: Parallel algorithms for nearest neighbor search problems in high dimensions

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