Some approaches to improve tree-based nearest neighbour search algorithms
From MaRDI portal
Publication:2575820
DOI10.1016/j.patcog.2005.06.007zbMath1080.68641MaRDI QIDQ2575820
Jose Oncina, Luisa Micó, Eva Gómez-Ballester
Publication date: 7 December 2005
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2005.06.007
68T10: Pattern recognition, speech recognition
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
A memetic algorithm for evolutionary prototype selection: A scaling up approach, A practical approach to the 2D incremental nearest-point problem suitable for different point distributions, Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
Cites Work
- Unnamed Item
- A Data Structure and an Algorithm for the Nearest Point Problem
- A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- The String-to-String Correction Problem
- PCA-based branch and bound search algorithms for computing K nearest neighbors