Testing some improvements of the fukunaga and narendra's fast nearest neighbour search algorithm in a spelling task

Authors:
Eva Gómez-Ballester;Luisa Micó;Jose Oncina
Affiliations:
Dept. Lenguajes y Sistemas Informáticos, Universidad de Alicante, Alicante, Spain;Dept. Lenguajes y Sistemas Informáticos, Universidad de Alicante, Alicante, Spain;Dept. Lenguajes y Sistemas Informáticos, Universidad de Alicante, Alicante, Spain
Venue:
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Year:
2005

Citing 4
Cited 0

A fast branch & bound nearest neighbour classifier in metric spaces

Pattern Recognition Letters
A Branch and Bound Algorithm for Computing k-Nearest Neighbors

IEEE Transactions on Computers
A Data Structure and an Algorithm for the Nearest Point Problem

IEEE Transactions on Software Engineering
OPUS: an efficient admissible algorithm for unordered search

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. One of the most known fast nearest neighbour algorithms was proposed by Fukunaga and Narendra. The algorithm builds a tree in preprocess time that is traversed on search time using some elimination rules to avoid its full exploration. This paper tests two new types of improvements in a real data environment, a spelling task. The first improvement is a new (and faster to build) type of tree, and the second is the introduction of two new elimination rules. Both techniques, even taken independently, reduce significantly both: the number of distance computations and the search time expended to find the nearest neighbour.