An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
From MaRDI portal
Publication:5458545
Recommendations
- scientific article; zbMATH DE number 5670169
- Some approaches to improve tree-based nearest neighbour search algorithms
- The efficiency of using k-d trees for finding nearest neighbors in discrete space
- Fast neighbor search by using revised k-d tree
- Refinements to nearest-neighbor searching in k-dimensional trees
- scientific article; zbMATH DE number 1003290
- Algorithm for finding all \(k\) nearest neighbors
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
- scientific article; zbMATH DE number 1893569
- scientific article; zbMATH DE number 1696644
Cites work
- scientific article; zbMATH DE number 1003290 (Why is no real title available?)
- scientific article; zbMATH DE number 1256770 (Why is no real title available?)
- scientific article; zbMATH DE number 1559575 (Why is no real title available?)
- scientific article; zbMATH DE number 1559576 (Why is no real title available?)
- scientific article; zbMATH DE number 1559577 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 1775451 (Why is no real title available?)
- scientific article; zbMATH DE number 3806754 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- An algorithm for information structuring and retrieval
- Approximate nearest neighbor algorithms for Frechet distance via product metrics
- Cell-probe lower bounds for the partial match problem
- Efficient algorithms for substring near neighbor problem
- Entropy based nearest neighbor search in high dimensions
- Locality-sensitive hashing scheme based on \(p\)-stable distributions
- Lower Bounds on Locality Sensitive Hashing
- Lower bounds for high dimensional nearest neighbor search and related problems
- Nearest neighbor pattern classification
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Point location in arrangements of hyperplanes
Cited in
(9)- Randomized partition trees for nearest neighbor search
- Fast neighbor search by using revised \(k\)-d tree
- scientific article; zbMATH DE number 5670169 (Why is no real title available?)
- Parallel nearest neighbors in low dimensions with batch updates
- Random projection-based auxiliary information can improve tree-based nearest neighbor search
- The efficiency of using k-d trees for finding nearest neighbors in discrete space
- Automated flexion crease identification using internal image seams
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
- Refinements to nearest-neighbor searching in k-dimensional trees
This page was built for publication: An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458545)