Extending LAESA fast nearest neighbour algorithm to find the k nearest neighbours

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2396, Issue , 2002, Pages 718-724

  Moreno Seco, Francisco ^a   Micó, Luisa ^a   Oncina, Jose ^a  

^a UNIVERSITY OF ALICANTE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; LEARNING ALGORITHMS; NEAREST NEIGHBOR SEARCH; SYNTACTICS;

DISTANCE FUNCTIONS; EUCLIDEAN; K-NEAREST NEIGHBOURS; LINEAR APPROXIMATIONS; METRIC SPACES; NEAREST NEIGHBOUR; SEARCH ALGORITHMS; TRIANGLE INEQUALITY;

PATTERN RECOGNITION;

EID: 84868684914     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-70659-3_75     Document Type: Article

References (10)

1. Aibar, P., Juan, A., Vidal, E.: Extensions to the approximating and eliminating search algorithm (AESA) for finding k-nearest-neighbours. New Advances and Trends in Speech Recognition and Coding (1993) 23-28
2. Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley (1973)
3. Fukunaga, K., Narendra, M.: A branch and bound algorithm for computing k- nearest neighbors. IEEE Trans. Computing (1975) 24 750-753
4. Jain, A. K., Dubes, R. C.: Algorithms for clustering data. Prentice-Hall (1988)
5. Kalantari, I., Donald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Engineering (1983) 9 631-634
6. Micó, L., Oncina, J., Carrasco, R. C.: A fast branch and bound nearest neighbour classifier in metric spaces. Pattern Recognition Letters (1996) 17 731-739
7. Micó, L., Oncina, J., Vidal, E.: A new version of the nearest neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing-time and memory requirements. Pattern Recognition Letters (1994) 15 9-17
8. Vidal, E.: New formulation and improvements of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA). Pattern Recognition Letters (1994) 15 1-7
9. Wagner, R. A., Fischer, M. J.: The String-to-String Correction Problem. Journal of the Association for Computing Machinery (1974) 21(1) 168-173
10. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing (1989) 18 1245-1262