Reducing the computational cost of computing approximated median strings

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

Volumn 2396, Issue , 2002, Pages 47-55

  Martínez Hinarejos, Carlos D ^a   Juan, Alfonso ^a   Casacuberta, Francisco ^a   Mollineda, Ramón ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; COST REDUCTION; NEAREST NEIGHBOR SEARCH; SYNTACTICS;

CLASSIFICATION PERFORMANCE; COMPUTATIONAL COSTS; CUBIC ORDER; K NEAREST NEIGHBOURS (K-NN); NEAREST NEIGHBOUR RULES;

PATTERN RECOGNITION;

EID: 84880172000     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70659-3_4     Document Type: Conference Paper

References (15)

1. Duda, R. O., Hart, P., Stork, D. G., 2001. Pattern Classification. John Wiley.
2. de la Higuera, C., Casacuberta, F., 2000. The topology of strings: two np-complete problems. Theoretical Computer Science 230, 39-48.
3. Fu, K. S., 1982. Syntactic Pattern Recognition. Prentice-Hall.
4. Juan, A., Vidal, E., 1998. Fast Median Search in Metric Spaces. In: Proceedings of the 2nd International Workshop on Statistical Techniques in Pattern Recognition. Vol. 1451 of Lecture Notes in Computer Science. Springer-Verlag, Sydney, pp. 905-912.
5. Kohonen, T., 1985. Median strings. Pattern Recognition Letters 3, 309-313.
6. Kruzslicz, F., 1988. A greedy algorithm to look for median strings. In: Abstracts of the Conference on PhD Students in Computer Science. Institute of informatics of the J´ozsef Attila University.
7. Fischer, I., Zell, A., 2000. String averages and self-organizing maps for strings. In: Proceeding of the Second ICSC Symposium on Neural Computation. pp. 208-215.
8. Casacuberta, F., de Antonio, M., 1997. A greedy algorithm for computing approximate median strings. In: Proceedings of the VII Simposium Nacional de Reconocimiento de Formas y Análisis de Imágenes. pp. 193-198.
9. Martínez, C. D., Juan, A., Casacuberta, F., 2000. Use of Median String for Classification. In: Proceedings of the 15th International Conference on Pattern Recognition. Vol. 2. Barcelona (Spain), pp. 907-910.
10. Vidal, E., Marzal, A., Aibar, P.,1995. Fast computation of normalized edit distances. IEEE Transactions on Pattern Analysis and Machine Intelligence 17 (9), 899-902.
11. Martínez, C., Juan, A., Casacuberta, F., 2001. Improving classification using median string and nn rules. In: Proceedings of IX Simposium Nacional de Reconocimiento de Formas y Análisis de Imágenes. pp. 391-394.
12. Lundsteen, C., Philip, J., Granum, E., 1980. Quantitative Analysis of 6895 Digitized Trypsin G-banded Human Metaphase Chromosomes. Clinical Genetics 18, 355-370.
13. Granum, E., Thomason, M., 1990. Automatically Inferred Markov Network Models for Classification of Chromosomal Band Pattern Structures. Cytometry 11, 26-39.
14. Granum, E., Thomason, M. J., Gregor, J. On the use of automatically inferred Markov networks for chromosome analysis. In C Lundsteen and J Piper, editors, Automation of Cytogenetics, pages 233-251. Springer-Verlag, Berlin, 1989.
15. Martínez-Hinarejos, C. D., Juan, A., Casacuberta, F., Median String for k-Nearest Neighbour classification, Pattern Recognition Letters, acepted for revision.