Composer classification using melodic combinatorial n-grams

被引:1
|
作者
Alvarez, Daniel Alejandro Perez [1 ]
Gelbukh, Alexander [1 ,2 ]
Sidorov, Grigori [1 ]
机构
[1] Inst Politecn Nacl IPN, Ctr Comp Res CIC, Mexico City, Mexico
[2] Inst Politecn Nacl IPN, Ctr Invest Comp CIC, Ave Juan de Dios Batiz S-N, Mexico City 07320, Mexico
关键词
Composer classification; Composer recognition; Composer identification; Composer attribution; Composer style; n-grams; Combinatorial n-grams; Mozart; Haydn; PATTERN-RECOGNITION; MACHINES; HAYDN;
D O I
10.1016/j.eswa.2024.123300
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the present study, we investigate the supervised problem of composer classification. From a set of compositions and a set of composers, we seek to assign each composition to the correct composer using machine learning and natural language processing techniques. Our objective focused on using the n -gram technique to create vector representations of musical compositions and classify them using the Support Vector Machines (SVM) classifier on a term -frequency matrix composed of the vectors of the compositions. Our representation takes into account melodic relationships between instruments in polyphonic pieces. We extract n -grams in melodic direction, allowing us to go from one instrument to another in the process, which aims to generate more robust n -grams and a greater quantity of occurrences of n -grams. We evaluate different classification models using feature filtering and varying hyperparameters such as the TF-IDF formula, among others. We test our method on a dataset made of string quartets by composers Haydn and Mozart, achieving results that improves upon previous state-of-the-art results.
引用
收藏
页数:11
相关论文
共 50 条
  • [31] Identifying Similar Sentences by Using N-Grams of Characters
    Sultana, Saima
    Biskri, Ismail
    RECENT TRENDS AND FUTURE TECHNOLOGY IN APPLIED INTELLIGENCE, IEA/AIE 2018, 2018, 10868 : 833 - 843
  • [32] Clone Detection for Ecore Metamodels using N-grams
    Babur, Onder
    PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON MODEL-DRIVEN ENGINEERING AND SOFTWARE DEVELOPMENT, 2018, : 411 - 419
  • [33] USING N-GRAMS TO IDENTIFY EDIT WARS ON WIKIPEDIA
    Ghosh, Arjun
    2019 IEEE FIFTH INTERNATIONAL CONFERENCE ON MULTIMEDIA BIG DATA (BIGMM 2019), 2019, : 398 - 403
  • [34] Document Verification Using n-grams and Histograms of Words
    Almarimi, Abdulwahed
    Andrejkova, Gabriela
    Sedmak, Peter
    2015 IEEE 13TH INTERNATIONAL SCIENTIFIC CONFERENCE ON INFORMATICS, 2015, : 15 - 20
  • [35] Source code authorship attribution using n-grams
    Burrows, Steven
    Tahaghoghi, S.M.M.
    ADCS 2007 - Proceedings of the Twelfth Australasian Document Computing Symposium, 2007, : 32 - 39
  • [36] Using n-grams of spatial densities to construct maps
    Maffei, Renan
    Jorge, Vitor A. M.
    Rey, Vitor E.
    Franco, Guilherme S.
    Giambastiani, Mariane
    Barbosa, Jessica
    Kolberg, Mariana
    Prestes, Edson
    2015 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2015, : 3850 - 3855
  • [37] Comparing Medline citations using modified N-grams
    Nawab, Rao Muhammad Adeel
    Stevenson, Mark
    Clough, Paul
    JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, 2014, 21 (01) : 105 - 110
  • [38] Using n-grams for the Automated Clustering of Structural Models
    Babur, Onder
    Cleophas, Loek
    SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2017, 10139 : 510 - 524
  • [39] Embedded malware detection using Markov n-grams
    Shafiq, M. Zubair
    Khayam, Syed Ali
    Farooq, Muddassar
    DETECTION OF INTRUSIONS AND MALWARE, AND VULNERABILITY ASSESSMENT, 2008, 5137 : 88 - +
  • [40] Language Distance using Common N-Grams Approach
    Kosmajac, Dijana
    Keselj, Vlado
    2020 19TH INTERNATIONAL SYMPOSIUM INFOTEH-JAHORINA (INFOTEH), 2020,