Some Improvements in Tree Based Nearest Neighbour Search Algorithms

  • Eva Gómez-Ballester
  • Luisa Micó
  • Jose Oncina
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2905)

Abstract

Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. In this paper we are interested on tree based algorithms that only make use of the metric properties of the space. One of the most known and refereed method in this class was proposed by Fukunaga and Narendra in the 70’s.

This algorithm uses a tree that is traversed on search time and uses some elimination rules to avoid the full exploration of the tree.

This paper proposes two main contributions: two new ways for constructing the tree and two new elimination rules. As shown in the experiment section, both techniques reduce significantly the number of distance computations.

Keywords

Nearest Neighbour Metric Spaces Elimination rule Pattern Recognition 

References

  1. 1.
    Dasarathy, B.V.: Nearest Neighbour(NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)Google Scholar
  2. 2.
    Chen, Y.S., Hung, Y.P., Fuh, C.S.: Fast Algorithm for Nearest Neighbour Search Based on a Lower Bound Tree. In: Proceedings of the 8th International Conference on Computer Vision, Vancouver, Canada, vol. 1, pp. 446–453 (2001)Google Scholar
  3. 3.
    Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)MATHGoogle Scholar
  4. 4.
    Fukunaga, K., Narendra, M.: A branch and bound algorithm for computing k– nearest neighbours. IEEE Trans. Computing 24, 750–753 (1975)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Engineering 9, 631–634 (1983)CrossRefGoogle Scholar
  6. 6.
    Miclet, L., Dabouz, M.: Approximate fast nearest-neighbour recognition. Pattern Recognition Letters 1, 277–285 (1983)CrossRefGoogle Scholar
  7. 7.
    Micó, L., Oncina, J., Carrasco, R.C.: A fast branch and bound nearest neighbour classifier in metric spaces. Pattern Recognition Letters 17, 731–739 (1996)CrossRefGoogle Scholar
  8. 8.
    Alinat, P.: Periodic progress report 4, ROARS project ESPRIT II – Number 5516. Thomson Technical Report TS ASM 93/S/EGS/NC/079 (1993)Google Scholar
  9. 9.
    Omachi, S., Aso, H.: A fast algorithm for a k-NN classifier based on branch and bound method and computational quantity estimation. Systems and Computers in Japan 31(6), 1–9 (2000)CrossRefGoogle Scholar
  10. 10.
    Webb, G.I.: OPUS: An Efficient Admissible Algorithm for Unordered Search. Journal of Artificial Intelligence Research 3, 431–465 (1995)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Eva Gómez-Ballester
    • 1
  • Luisa Micó
    • 1
  • Jose Oncina
    • 1
  1. 1.Dept. Lenguajes y Sistemas InformáticosUniversidad de AlicanteAlicanteSpain

Personalised recommendations