Approximate nearest neighbour search with the fukunaga & narendra algorithm
Tutor / director / evaluatorAluja Banet, Tomàs
Document typeMaster thesis
Rights accessOpen Access
English: Nearest neighbour search is the one of the most simple and used technique in Pattern Recognition due to its simplicity and its good behaviour.. Many fast NN search algorithm have been developed during last years. However, in some classifacation tasks an exact NN search is too slow, and a way to quicken the search is required. To face these tasks it is possible to use approximate NN search, which usually increases error rates but highly reduces search time. One of the most known faster nearest neighbour algorithms was proposed by Fugunada and Naendra. There are two way to perfoem the algorithm: building a tree or performing clustering(classic way) in process time that is traversed on search time using some elimination rules to avoid its full exploration. This paper tests one type of the improvement in a real data environment. A new priority list is invited in order to reduce significant both: the number of distance computations and the search time expended to find the nearest neighbour. This work has been developed on the program R-project version 2.13.1. over a computer with Windows Vista 32 bits, CPU: AMD Athlon X2 Dual-Duo CPU 2.00GHz and RAM: 2038 MB.