Parallel algorithms for nearest neighbor search problems in high dimensions
DOI10.1137/15M1026377zbMATH Open1349.68231MaRDI QIDQ2830635FDOQ2830635
Authors: Bo Xiao, George Biros 
Publication date: 28 October 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
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
machine learningdata analysiscomputational statisticsparallel algorithmstree codesnearest neighbor algorithms
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)
Cites Work
- Title not available (Why is that?)
- The elements of statistical learning. Data mining, inference, and prediction
- Gaussian processes for machine learning.
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Foundations of multidimensional and metric data structures.
- Satisfying general proximity/similarity queries with metric trees
- Separators for sphere-packings and nearest neighbor graphs
- A non-linear dimension reduction methodology for generating data-driven stochastic input models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding nearest neighbors in growth-restricted metrics
- Parallel Processing for Scientific Computing
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- Title not available (Why is that?)
- ASKIT: approximate skeletonization kernel-independent treecode in high dimensions
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
Uses Software
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)
