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 条
  • [11] Feature selection on Chinese text classification using character n-grams
    Wei, Zhihua
    Miao, Duoqian
    Chauchat, Jean-Hugues
    Zhong, Caiming
    ROUGH SETS AND KNOWLEDGE TECHNOLOGY, 2008, 5009 : 500 - +
  • [12] The Distribution of N-Grams
    Leo Egghe
    Scientometrics, 2000, 47 : 237 - 252
  • [13] A Hierarchical n-Grams Extraction Approach for Classification Problem
    Mhamdi, Faouzi
    Rakotomalala, Ricco
    Elloumi, Mourad
    ADVANCED INTERNET BASED SYSTEMS AND APPLICATIONS, 2009, 4879 : 211 - +
  • [14] Hierarchical classification of Chinese documents based on N-grams
    Guan, JH
    Zhou, SG
    DIGITAL LIBRARIES: TECHNOLOGY AND MANAGEMENT OF INDIGENOUS KNOWLEDGE FOR GLOBAL ACCESS, 2003, 2911 : 643 - 652
  • [15] Collocations and N-grams
    FREEBURY-JONES, D. A. R. R. E. N.
    RENAISSANCE AND REFORMATION, 2021, 44 (04) : 210 - 216
  • [16] The distribution of N-grams
    Egghe, L
    SCIENTOMETRICS, 2000, 47 (02) : 237 - 252
  • [17] Towards an automatic classification of images: Approach by the n-grams
    Laouamer, Lamri
    Biskri, Ismail
    Houmadi, Benamar
    WMSCI 2005: 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Vol 3, 2005, : 73 - 78
  • [18] SPEECH RECOGNITION USING FUNCTION-WORD N-GRAMS AND CONTENT-WORD N-GRAMS
    ISOTANI, R
    MATSUNAGA, S
    SAGAYAMA, S
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (06) : 692 - 697
  • [19] Error Classification Using Automatic Measures Based on n-grams and Edit Distance
    Benko, L'ubomir
    Benkova, Lucia
    Munkova, Dasa
    Munk, Michal
    Shulzenko, Danylo
    ADVANCED RESEARCH IN TECHNOLOGIES, INFORMATION, INNOVATION AND SUSTAINABILITY, ARTIIS 2022, PT I, 2022, 1675 : 345 - 356
  • [20] Plagiarism Detection Using Stopword n-grams
    Stamatatos, Efstathios
    JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2011, 62 (12): : 2512 - 2527