A fast nearest neighbor search algorithm by filtration

DOI10.1016/S0031-3203(01)00032-2zbMath0993.68103OpenAlexW2055918842MaRDI QIDQ5959621

Sargur N. Srihari, Sung-Hyuk Cha

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

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

Related Items (1)

Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: a review and state-of-the-art

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• An Algorithm for Finding Best Matches in Logarithmic Expected Time

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