A fast nearest neighbor search algorithm by filtration

DOI10.1016/S0031-3203(01)00032-2MaRDI QIDQ5959621zbMATH OpenOpenAlexFDO

Authors Sung-Hyuk Cha, Sargur N. Srihari

Publication date 14 March 2002

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0031-3203(01)00032-2

zbMATH Keywords

Pattern Recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1759582
• Improved \(k\)-nearest neighbor classification
• scientific article; zbMATH DE number 78497
• Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
• scientific article; zbMATH DE number 1692454

Cites work

• 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
• scientific article; zbMATH DE number 3692659 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)

Cited in

(5)

• Fast FILTERSIM simulation with score-based distance
• Maximum-likelihood approximate nearest neighbor method in real-time image recognition
• The family of algorithms LOKATOR for fast search of the closest analogue
• scientific article; zbMATH DE number 1759582 (Why is no real title available?)
• Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: a review and state-of-the-art

This page was built for publication: A fast nearest neighbor search algorithm by filtration

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