Probably correct k-nearest neighbor search in high dimensions
From MaRDI portal
(Redirected from Publication:962679)
Probably correct \(k\)-nearest neighbor search in high dimensions
Probably correct \(k\)-nearest neighbor search in high dimensions
Recommendations
Cites work
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- An Algorithm for Finding Nearest Neighbors
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 1163871 (Why is no real title available?)
- scientific article; zbMATH DE number 1559575 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 1893569 (Why is no real title available?)
- Multidimensional binary search trees used for associative searching
- Nearest neighbor pattern classification
- Optimal Expected-Time Algorithms for Closest Point Problems
Cited in
(4)- Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data
- Constructing a high-dimensional kNN-graph using a Z-order curve
- Reducing non-determinism of k-NN searching in non-ordered discrete data spaces
- Probabilistic proximity searching algorithms based on compact partitions
This page was built for publication: Probably correct \(k\)-nearest neighbor search in high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962679)
