On optimizing the editing algorithms for evaluating similarity between monophonic musical sequences

被引:15
|
作者
Hanna, Pierre [1 ]
Ferraro, Pascal [1 ]
Robine, Matthias [1 ]
机构
[1] Univ Bordeaux, Bordeaux, France
关键词
D O I
10.1080/09298210801927861
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Melody is an important property for the perceptual description of Western musical pieces. In the monophonic context, retrieval systems based on melodic similarity generally consider sequences of pitches and durations. Algorithms that have been proposed for measuring melodic similarity rely on geometric representations, string matching techniques, etc. Adaptations of editing algorithms, mainly applied in bioinformatic applications, to the musical domain have already been proposed. However, we present in this paper several experiments in order to optimize these methods. The different possible representations for pitches and durations are discussed and evaluated. Optimizations specific to musical applications are proposed and imply significant improvements of the editing algorithm studied. Evaluation of this algorithm led to the best results during the MIREX 2006 symbolic melodic similarity contest.
引用
下载
收藏
页码:267 / 279
页数:13
相关论文
共 50 条
  • [31] Efficient algorithms for finding interleaving relationship between sequences
    Huang, Kuo-Si
    Yang, Chang-Biau
    Tseng, Kuo-Tsung
    Ann, Hsing-Yen
    Peng, Yung-Hsing
    INFORMATION PROCESSING LETTERS, 2008, 105 (05) : 188 - 193
  • [32] Comparison between text compression algorithms inbiological sequences
    Kounelis, Fotios
    Makris, Christos
    INFORMATION AND COMPUTATION, 2020, 270
  • [33] Sequences in harmony: Cognitive interactions between musical and visual narrative structure
    Patrick, Morgan T.
    Cohn, Neil
    Mertus, John
    Blumstein, Sheila E.
    ACTA PSYCHOLOGICA, 2023, 238
  • [34] New Efficient Bit-Parallel Algorithms for the δ-Matching Problem with α-Bounded Gaps in Musical Sequences
    Cantone, Domenico
    Cristofaro, Salvatore
    Faro, Simone
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2008, 2008, : 170 - 184
  • [35] PARALLEL ALGORITHMS FOR EVALUATING SEQUENCES OF SET-MANIPULATION OPERATIONS - (PRELIMINARY VERSION)
    ATALLAH, MJ
    GOODRICH, MT
    KOSARAJU, SR
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 319 : 1 - 10
  • [36] SIMPLE FAST ALGORITHMS FOR THE EDITING DISTANCE BETWEEN TREES AND RELATED PROBLEMS
    ZHANG, KZ
    SHASHA, D
    SIAM JOURNAL ON COMPUTING, 1989, 18 (06) : 1245 - 1262
  • [38] FAST PARALLEL ALGORITHMS FOR THE UNIT COST EDITING DISTANCE BETWEEN TREES
    SHASHA, D
    ZHANG, KZ
    SPAA 89: PROCEEDINGS OF THE 1989 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, 1989, : 117 - 126
  • [39] STRUCTURAL SIMILARITY BETWEEN THE PLECKSTRIN HOMOLOGY DOMAIN AND VEROTOXIN - THE PROBLEM OF MEASURING AND EVALUATING STRUCTURAL SIMILARITY
    ORENGO, CA
    SWINDELLS, MB
    MICHIE, AD
    ZVELEBIL, MJ
    DRISCOLL, PC
    WATERFIELD, MD
    THORNTON, JM
    PROTEIN SCIENCE, 1995, 4 (10) : 1977 - 1983
  • [40] Evaluating the POWER8 Architecture Through Optimizing Stencil-Based Algorithms
    Xu, Jingheng
    Fu, Haohuan
    Gan, Lin
    Song, Yu
    Peng, Hongbo
    Shi, Wen
    Yang, Guangwen
    2016 IEEE TRUSTCOM/BIGDATASE/ISPA, 2016, : 1374 - 1381