skip to main content
10.1145/3273024.3273033acmotherconferencesArticle/Chapter ViewAbstractPublication PagesdlfmConference Proceedingsconference-collections
research-article

Evaluating symbolic representations in melodic similarity

Published:28 September 2018Publication History

ABSTRACT

Symbolic melodic similarity measures have been the subject of considerable investigation for their role in content-based querying, digital musicological analysis, and other data driven applications of Music Information Retrieval (MIR). Despite these efforts, there has been little focus on the representations or encodings employed by symbolic similarity measures, and how each of these representations affects the analysis that follows it. Understanding how these similarity measures behave can improve the way we index and retrieve digital musical content, and offer insights into the underlying musical patterns.

This work explores how five melodic encodings, with varying information types and loss, behave using common string matching melodic similarity measures for exact and inexact matching, both globally and locally. The differences in the various symbolic melodic encodings are summarized to provide understanding and context as to when and in what applications these encodings could be applied.

References

  1. Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Nuñez, David Rappaport, and Godfried Toussaint. 2006. Algorithms for Computing Geometric Measures of Melodic Similarity. Computer Music Journal 30, 3 (2006), 67--76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ole Martin Bjørndalen and Rapolas Binkys. {n. d.}. Mido - MIDI Objects for Python. https://mido.readthedocs.io/en/latest.Google ScholarGoogle Scholar
  3. Emilios Cambouropoulos, Tim Crawford, and Costas S Iliopoulos. 2001. Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects. Computers and the Humanities 35, 1 (2001), 9--21.Google ScholarGoogle ScholarCross RefCross Ref
  4. Kranthi Chandra. 2016. Variants of Longest Common Subsequence Problem. Ph.D. Dissertation. Rochester Institute of Technology.Google ScholarGoogle Scholar
  5. J Stephen Downie. 1999. Evaluating a Simple Approach to Music Information Retrieval: Conceiving Melodic N-Grams as Text. The University of Western Ontario, London (1999).Google ScholarGoogle Scholar
  6. Pascal Ferraro and Pierre Hanna. 2007. Optimizations of Local Edition for Evaluating Similarity Between Monophonic Musical Sequences. In Large Scale Semantic Access to Content (Text, Image, Video, and Sound). Le Centre des Hautes Études Internationales d'Informatique Documentaire, 64--69. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Dan Gusfield. 1997. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Pierre Hanna, Pascal Ferraro, and Matthias Robine. 2007. On Optimizing the Editing Algorithms for Evaluating Similarity Between Monophonic Musical Sequences. Journal of New Music Research 36, 4 (2007), 267--279.Google ScholarGoogle ScholarCross RefCross Ref
  9. Ludger Hofmann-Engl. 2002. Melodic Transformations and Similarity - A Theoretical and Empirical Approach. Ph.D. Dissertation. Phd Thesis, Keele University.Google ScholarGoogle Scholar
  10. Holger H Hoos, Kai Renz, and Marko Görg. 2001. GUIDO/MIR-an Experimental Musical Information Retrieval System Based on GUIDO Music Notation.. In ISMIR. 41--50.Google ScholarGoogle Scholar
  11. Karin Höthker, Dominik Hörnel, and Christina Anagnostopoulou. 2001. Investigating the Influence of Representations and Algorithms in Music Classification. Computers and the Humanities 35, 1 (2001), 65--79.Google ScholarGoogle ScholarCross RefCross Ref
  12. Berit Janssen, Peter van Kranenburg, and Anja Volk. 2015. A Comparison of Symbolic Similarity Measures for Finding Occurrences of Melodic Segments. In Proceedings of the 16th ISMIR Conference, Málaga, Spain, October 26--30, 2015. ISMIR press, 659--665.Google ScholarGoogle Scholar
  13. Carol L Krumhansl. 2001. Cognitive Foundations of Musical Pitch. Oxford University Press.Google ScholarGoogle Scholar
  14. Ben Langmead. 2013. Tries and Suffix Tries. http://www.cs.jhu.edu/~langmea/resources/lecture_notes/tries_and_suffix_tries.pdf.Google ScholarGoogle Scholar
  15. Chih-Chin Liu, Jia-Lien Hsu, and Arbee LP Chen. 1999. An Approximate String Matching Algorithm for Content-Based Music Data Retrieval. In Multimedia Computing and Systems, 1999. IEEE International Conference on, Vol. 1. IEEE, 451--456. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. David W Mount. 2004. Bioinformatics: Sequence and Genome Analysis. Cold Spring Harbor Laboratory Press, New York. 1--18 pages.Google ScholarGoogle Scholar
  17. Meinard Müller. 2015. Fundamentals of Music Processing: Audio, Analysis, Algorithms, Applications. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Saul B Needleman and Christian D Wunsch. 1970. A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins. Journal of molecular biology 48, 3 (1970), 443--453.Google ScholarGoogle ScholarCross RefCross Ref
  19. Denys Parsons. 1975. The Directory of Tunes and Musical Themes. Cambridge, England.Google ScholarGoogle Scholar
  20. Emanuele Pollastri and Giuliano Simoncelli. 2001. Classification of Melodies by Composer with Hidden Markov Models. In wedelmusic. IEEE, 0088. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Valery O Polyanovsky, Mikhail A Roytberg, and Vladimir G Tumanyan. 2011. Comparative Analysis of the Quality of a Global Algorithm and a Local Algorithm for Alignment of two Sequences. Algorithms for molecular biology 6, 1 (2011), 25.Google ScholarGoogle Scholar
  22. Colin Raffel. {n. d.}. Lakh MIDI Dataset v0.1. http://colinraffel.com/projects/lmd.Google ScholarGoogle Scholar
  23. Colin Raffel. 2016. Learning-Based Methods for Comparing Sequences, With Applications to Audio-to-MIDI Alignment and Matching. Columbia University.Google ScholarGoogle Scholar
  24. Mark A Schmuckler. 1999. Testing Models of Melodic Contour Similarity. Music Perception: An Interdisciplinary Journal 16, 3 (1999), 295--326.Google ScholarGoogle ScholarCross RefCross Ref
  25. Temple F Smith and Michael S Waterman. 1981. Identification of Common Molecular Subsequences. Journal of molecular biology 147, 1 (1981), 195--197.Google ScholarGoogle ScholarCross RefCross Ref
  26. Iman SH Suyoto and Alexandra L Uitdenbogerd. 2005. Effectiveness of Note Duration Information for Music Retrieval. In International Conference on Database Systems for Advanced Applications. Springer, 265--275. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Yongwei Zhu, Mohan S Kankanhalli, and Qi Tian. 2002. Similarity Matching of Continuous Melody Contours for Humming Querying of Melody Databases. In IEEE Workshop on Multimedia Signal Processing. 249--252.Google ScholarGoogle Scholar

Index Terms

  1. Evaluating symbolic representations in melodic similarity

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      DLfM '18: Proceedings of the 5th International Conference on Digital Libraries for Musicology
      September 2018
      101 pages
      ISBN:9781450365222
      DOI:10.1145/3273024

      Copyright © 2018 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 28 September 2018

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      DLfM '18 Paper Acceptance Rate14of27submissions,52%Overall Acceptance Rate27of48submissions,56%
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader