Median strings for k-nearest neighbour classification

Pattern Recognition Letters

Volumn 24, Issue 1-3, 2003, Pages 173-181

  Martinez Hinarejos C D ^a   Casacuberta, A Juan F ^a  

^a INSTITUTO TECNOLÓGICO DE INFORMÁTICA   (Spain)

Author keywords

Clustering; K NN classifiers; Median string; Prototype extraction

Indexed keywords

ALGORITHMS; CHROMOSOMES;

MEDIAN STRINGS;

PATTERN RECOGNITION;

NEAREST NEIGHBOR ANALYSIS;

EID: 0037233442     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00209-X     Document Type: Article

References (19)

1. Casacuberta, F., de Antonio, M., 1997. A greedy algorithm for computing approximate median strings. In: Proc. VII Simposium Nacional de Reconocimiento de Formas y Análisis de Imágenes. pp. 193-198.
2. de la Higuera, C., Casacuberta, F., 2000. The topology of strings: two np-complete problems. Theor. Comp. Sci. 230, 39-48.
3. Duda, R.O., Hart, P., Stork, D.G., 2001. Pattern Classification. John Wiley.
4. Fischer, I., Zell, A., 2000. String averages and self-organizing maps for strings. In: Proc. Second ICSC Symposium on Neural Computation, pp. 208-215.
5. Fu, K.S., 1982. Syntactic Pattern Recognition. Prentice-Hall.
6. Granum, E., Thomason, M., 1990. Automatically inferred Markov network models for classification of chromosomal band pattern structures. Cytometry 11, 26-39.
7. Gregor, J., Thomason, M.G., 1996. A Disagreement Count Scheme for Inference of Constrained Markov Networks. In: Miclet, L., Higuera, C.D. (Eds.), Grammatical Inference: Learning Syntax from Sentences. Vol. 1147 of Lecture Notes in Computer Science. Springer, pp. 168-178.
8. Juan, A., Vidal, E., 1994. Fast k-means-like clustering in metric spaces. Pattern Recognition Lett. 15, 19-25.
9. Juan, A., Vidal, E., 1998. Fast Median Search in Metric Spaces. In: Proc. 2nd International Workshop on Statistical Techniques in Pattern Recognition. Vol. 1451 of Lecture Notes in Computer Science. Springer-Verlag, Sydney, pp. 905-912.
10. Juan, A., Vidal, E., 2000. On the Use of Edit Distances and an Efficient k-NN Search Technique (k-AESA) for Fast and Accurate String Classification. In: Proc. 15th Internat. Conf. on Pattern Recognition, Vol. 2. Barcelona (Spain), pp. 680-683.
11. Kohonen, T., 1985. Median strings. Pattern Recognition Lett. 3, 309-313.
12. Kruzslicz, F., 1988. A greedy algorithm to look for median strings. In: Abstracts of the Conference on Ph.D. Students in Computer Science. Institute of informatics of the József Attila University.
13. Lundsteen, C., Philip, J., Granum, E., 1980. Quantitative analysis of 6895 digitized trypsin G-banded human metaphase chromosomes. Clinic. Genetics 18, 355-370.
14. Martínez, C.D., Juan, A., Casacuberta, F., 2000. Use of Median String for Classification. In: Proc. 15th Internat. Conf. on Pattern Recognition, Vol. 2. Barcelona (Spain), pp. 907-910.
15. Martínez, C.D., Juan, A., Casacuberta, F., 2001. Improving classification using median string and NN rules. In: Proc. IX Spanish Symposium on Pattern Recognition and Image Analysis, vol. II. Benicàssim (Spain), pp. 391-395.
16. Vidal, E., Castro, M.J., 1997. Classification of Banded Chromosomes using Error-Correcting Grammatical Inference (ECGI) and Multilayer Perceptron (MLP). In: Proc. VII Simposium Nacional de Reconocimiento de Formas y Análisis de Imágenes. Vol. 1. Bellaterrra (Spain), pp. 31-36.
17. Vidal, E., Castro, M.J., Sanchez, J.A., 1997. Classification of Banded Chromosomes. Tech. rep., DSIC, Universidad Politécnica de Valencia, Spain.
18. Vidal, E., Marzal, A., Aibar, P., 1995. Fast computation of normalized edit distances. IEEE Trans. Pattern Anal. Machine Intell. 17 (9), 899-902.
19. Wagner, R., Fisher, M., 1974. The string-to-string correction problem. J. ACM 21, 168-178.