Approximate nearest neighbour search with the Fukunaga and Narendra algorithm and its application to chromosome classification

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

Volumn 2905, Issue , 2003, Pages 322-328

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

^a UNIVERSITY OF ALICANTE   (Spain)

Author keywords

Approximate Nearest Neighbour; Chromosome Recognition; Pattern Recognition

Indexed keywords

ALGORITHMS; CHROMOSOMES; PATTERN RECOGNITION;

CHROMOSOME CLASSIFICATION; CLASSIFICATION RATES; CLASSIFICATION TASKS; GENERAL METRIC SPACES; K-NEAREST NEIGHBOURS; NEAREST NEIGHBOUR; NEAREST NEIGHBOUR SEARCH; SEARCH ALGORITHMS;

NEAREST NEIGHBOR SEARCH;

EID: 35248855093     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24586-5_39     Document Type: Article

References (13)

1. Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM (1998) 45 891-923
2. st VLDB Conference (1995) 574-584
3. Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley (1973)
4. Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software (1977) 3 209-226
5. Fukunaga, K., Narendra, M.: A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Computing (1975) 24 750-753
6. Granum, E., Thomason, M.G.: Automatically inferred Markov network models for classification of chromosomal band pattern structures. Cytometry (1990) 11 26-39
7. Granum, E., Thomason, M.G., Gregor, J.: On the use of automatically inferred Markov networks for chromosome analysis. In Automation of Cytogenetics, C. Lundsteen and J. Piper, eds., Springer-Verlag (1989) 233-251
8. Lundsteen, C., Phillip, J., Granum, E.: Quantitative analysis of 6985 digitized trypsin G-banded human metaphase chromosomes. Clinical Genetics (1980) 18 355-370
9. Moreno-Seco, F., Micó, L., Oncina, J.: Extending fast nearest neighbour search algorithms for approximate k-NN classification. Pattern Recognition and Image Analysis. Lecture Notes in Computer Science, F.J. Perales et al (Eds.) vol. 2652, Springer-Verlag (2003) 589-597
10. Nene, S., Nayar, S.: A Simple Algorithm for Nearest Neighbor Search in High Dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence (1997) 19(9) 989-1003
11. Vidal, E.: New formulation and improvements of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA). Pattern Recognition Letters (1994) 15 1-7
12. Wagner, R.A., Fischer, M.J.: The String-to-String Correction ProbIem. Journal of the Association for Computing Machinery (1974) 21(1) 168-173
13. Yianilos, P.N.: Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. ACM-SIAM Symposium on Discrete Algorithms (1993) 311-321