Melody recognition with learned edit distances

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

Volumn 5342 LNCS, Issue , 2008, Pages 86-96

  Habrard, Amaury ^a   Iñesta, José Manuel ^b   Rizo, David ^b   Sebban, Marc ^c  

^a AIX MARSEILLE UNIVERSITY   (France)

^b UNIVERSITY OF ALICANTE   (Spain)

^c UNIVERSITÉ JEAN MONNET   (France)

Author keywords

Edit distance learning; Genetic algorithms; Music similarity; Probabilistic models

Indexed keywords

COSTS; DISTANCE EDUCATION; GENETIC ALGORITHMS; LEARNING ALGORITHMS; SYNTACTICS; TREES (MATHEMATICS);

EDIT DISTANCE; MELODIC SIMILARITY; MUSIC SIMILARITY; PROBABILISTIC APPROACHES; PROBABILISTIC LEARNING; PROBABILISTIC MODELS; SIMILARITY MEASURE; TREE EDIT DISTANCE;

PATTERN RECOGNITION;

EID: 58449136038     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89689-0_13     Document Type: Conference Paper

References (19)

1. Bouchard, G., Triggs, B.: The trade-off between generative and discriminative classifiers. In: COMPSTAT 2004. Springer, Heidelberg (2004)
2. Mongeau, M., Sankoff, D.: Comparison of musical sequences. Computers and the Humanities 24. 161-175 (1990)
3. Gómez, C., Abad-Mota, S., Ruckhaus, E.: An Analysis of the Mongeau-Sankoff Algorithm for Music Information Retrieval. In: Proc. of the 8th International Conference on Music Information Retrieval (ISMIR), Vienna, Austria, pp. 109-110 (2007)
4. Grachten, M., Arcos, J., López de Mantaras, R.: Melody Retrieval using the Implication/Realization Model. In: Proceedings of the 6th International Conference on Music Information Retrieval, ISMIR 2005 (2005)
5. Rotstan, N., Meffert, K.: JGAP: Java Genetic Algorithms Package (accessed June 7, 2008), http://www.jgap.sf.net
6. Doraisamy, S., Rüger, M.: Robust Polyphonic Music Retrieval with N-grams. J. Intell. Inf. Syst. 21, 53-70 (2003)
7. Rizo, D., Moreno-Seco, F., Iñesta, J.M.: Tree-structured representation of musical information. In: Perales, F.J., Campilho, A.C., Pérez, N., Sanfeliu, A. (eds.) IbPRIA 2003. Lecture Notes in Computer Science (LNAl), vol. 2652, pp. 838-846. Springer, Heidelberg (2003)
8. Illeseas, P.R., Rizo, D., Iñesta, J.M.: Harmonic, melodic, and functional automatic analysis. In: Proc. International Computer Music Conference, pp. 165-168 (2007)
9. Aloupis, G., Fevens, T., Langerman, S., Matsui, T., Mesa, A., Nunez, Y., Rappaport, D., Toussaint, G.: Algorithms for Computing Geometric Measures of Melodic Similarity. Computer Music Journal, Fall 2006 30(3), 67-76 (2006)
10. Bernard, M., Habrard, A., Sebban, M.: Learning stochastic tree edit distance. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS, vol. 4212, pp. 42-53. Springer, Heidelberg (2006)
11. Bernard, M., Janodet, J.-C., Sebban, M.: A discriminative model of stochastic edit distance in the form of a conditional transducer. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS, vol. 4201, pp. 240-252. Springer, Heidelberg (2006)
12. Dempster, A., Laird, M., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. B(39), 1-38 (1977)
13. Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological sequence analysis. Cambridge University Press, Cambridge (1998)
14. Boyer, L., Habrard, A., Sebban, M.: Learning metrics between tree structured data: Application to image recognition. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenić, D., Skowron, A. (eds.) ECML 2007. LNCS, vol. 4701, pp. 54-66. Springer, Heidelberg (2007)
15. McCallum, A., Bellare, K., Pereira, P.: A conditional random field for disciminatively-trained finite-state string edit distance. In: Proc. of UAI 2005, pp. 388-400 (2005)
16. Oncina, J., Sebban, M.: Learning stochastic edit distance: application in handwritten character recognition. J. of Pattern Recognition 39(9), 1575-1587 (2006)
17. Ristad, S.V., Yianilos, P.N.: Learning string-edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(5), 522-532 (1998)
18. Selkow, S.M.: The tree-to-tree editing problem. Information Processing Letters 6(6), 184-186 (1977)
19. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 1245-1262 (1989)