Skip to main content
Springer Nature Link
Log in

Testing Some Improvements of the Fukunaga and Narendra’s Fast Nearest Neighbour Search Algorithm in a Spelling Task

  • Conference paper
Pattern Recognition and Image Analysis (IbPRIA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3523))

Included in the following conference series:

  • 1673 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dasarathy, B.V.: Nearest Neighbour(NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  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. Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)

    MATH  Google Scholar 

  4. Fukunaga, K., Narendra, M.: A branch and bound algorithm for computing k– nearest neighbours. IEEE Trans. Computing 24, 750–753 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Engineering 9, 631–634 (1983)

    Article  Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. 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 

  8. 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)

    Article  Google Scholar 

  9. Geofrey, I.: Webb: OPUS: An Efficient Admissible Algorithm for Unordered Search. Journal of Artificial Intelligence Research 3, 431–465 (1995)

    Google Scholar 

  10. Kamgar-Parsi, B., Kanal, L.: An improved branch and bound algorithm for computing k-nearest neighbors. Pattern Recognition Letters 3, 7–12 (1985)

    Article  Google Scholar 

  11. Gómez-Ballester, E., Micó, L., Oncina, J.: Some improvements in tree based nearest neighbour algorithms. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol. 2905, pp. 456–463. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Lenguajes y Sistemas Informáticos, Universidad de Alicante, E-03071, Alicante, Spain

    Eva Gómez-Ballester, Luisa Micó & Jose Oncina

Authors
  1. Eva Gómez-Ballester
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luisa Micó
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jose Oncina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto Superior Técnico & Instituto de Sistemas e Robótica,, 1049-001, Lisboa, Portugal

    Jorge S. Marques

  2. ETSI Informática y e Telecomunicación, University of Granada, 18071, Granada, Spain

    Nicolás Pérez de la Blanca

  3. Instituto Superior Técnico, CERENA-Centro de Recursos Naturais e Ambiente, Av. Rovisco Pais, 1049-001, Lisboa, Portugal

    Pedro Pina

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gómez-Ballester, E., Micó, L., Oncina, J. (2005). Testing Some Improvements of the Fukunaga and Narendra’s Fast Nearest Neighbour Search Algorithm in a Spelling Task. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11492542_1

Download citation

  • DOI: https://doi.org/10.1007/11492542_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26154-4

  • Online ISBN: 978-3-540-32238-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics