Fast exact k nearest neighbors search using an orthogonal search tree
From MaRDI portal
Publication:962830
Recommendations
Cites work
- scientific article; zbMATH DE number 3398592 (Why is no real title available?)
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
- Image restoration of compressed image using classified vector quantization
- Improvement of the fast exact pairwise-nearest-neighbor algorithm
- Nearest neighbor pattern classification
- New algorithms for efficient high-dimensional nonparametric classification
- Principal component analysis.
- Refinements to nearest-neighbor searching in k-dimensional trees
Cited in
(14)- Fast neighbor search by using revised k-d tree
- VBLSH: volume-balancing locality-sensitive hashing algorithm for K-nearest neighbors search
- scientific article; zbMATH DE number 2090268 (Why is no real title available?)
- scientific article; zbMATH DE number 2066190 (Why is no real title available?)
- An MPCA/LDA based dimensionality reduction algorithm for face recognition
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- Fast \(k\)-nearest-neighbor search based on projection and triangular inequality
- Improvement of the fast exact pairwise-nearest-neighbor algorithm
- Answering k-NN query of Chinese calligraphic character based on data grid
- scientific article; zbMATH DE number 5670169 (Why is no real title available?)
- Algorithm for finding k-nearest neighbors based on octree segmentation in space
- A variant of \(k\)-nearest neighbors search with cyclically permuted query points for rotation-invariant image processing
- Refinements to nearest-neighbor searching in k-dimensional trees
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
This page was built for publication: Fast exact \(k\) nearest neighbors search using an orthogonal search tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962830)