Joint-optimized feature selection and classifier hyperparameters by salp swarm algorithm in piano score difficulty measurement problem

超参数 计算机科学 分类器(UML) 人工智能 超参数优化 特征选择 粒子群优化 最优化问题 模式识别(心理学) 机器学习 特征向量 算法 支持向量机
作者
Hui Yan,Qiang Li,Ming‐Lang Tseng,Xin Guan
出处
期刊:Applied Soft Computing [Elsevier BV]
卷期号:144: 110464-110464 被引量:1
标识
DOI:10.1016/j.asoc.2023.110464
摘要

This study proposes the semantic-explicit features that characterize difficulty, and jointly optimizes feature selection and classifier hyperparameters by the salp swarm algorithm (SSA) to deal with the corresponding mixed-integer programming problem with constructing large-scale piano score difficulty level datasets. The difficulty level of piano scores is essential for piano learners to choose the appropriate piece, especially for beginners and amateurs. However, the previous studies lack an open-access baseline dataset and sufficient difficulty-related features, as well as the separate optimization of and feature and model hyperparameter. To address such problems, this study constructs large-scale difficulty-level datasets, proposes novel difficulty-related features, and jointly optimizes feature selection and classifier hyperparameters due to the coupled effect of feature selection and model optimization. The search space of the joint optimization is complex due to the strong mutual constraint relationship of difficulty levels in the piano-score difficulty measurement (PSDM) problem. SSA is adapted to the joint optimization scheme of the PSDM problem with the advantages of only one main controlling parameter and less computation complexity involving the gradual SSA movement approach to balance global exploration and local exploitation in an unknown and complex search space. The joint-optimization mechanism by SSA achieves an overall accuracy of 78.80% and 60.68% on two datasets of 677 and 2040 piano pieces with difficulty levels of four and nine, respectively. The results of recognition accuracy obviously validate the distinguished performance of our joint-optimization scheme compared to the successive optimization and joint optimization by other seven optimization algorithms in terms of the PSDM problem.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
我是阳光菇完成签到 ,获得积分10
刚刚
刚刚
1秒前
1秒前
1秒前
1秒前
平常心完成签到,获得积分10
1秒前
1秒前
1秒前
1秒前
2秒前
4秒前
SciGPT应助大班肄业采纳,获得10
4秒前
妥妥应助科研通管家采纳,获得30
5秒前
5秒前
5秒前
Hello应助科研通管家采纳,获得10
5秒前
科目三应助科研通管家采纳,获得10
5秒前
歪歪发布了新的文献求助10
5秒前
丘比特应助科研通管家采纳,获得10
5秒前
Jasper应助科研通管家采纳,获得10
5秒前
cdercder应助科研通管家采纳,获得10
6秒前
隐形曼青应助科研通管家采纳,获得10
6秒前
pluto应助科研通管家采纳,获得10
6秒前
田様应助科研通管家采纳,获得10
6秒前
6秒前
顾矜应助科研通管家采纳,获得10
6秒前
6秒前
852应助科研通管家采纳,获得30
6秒前
wanci应助科研通管家采纳,获得10
6秒前
修仙中应助科研通管家采纳,获得10
7秒前
7秒前
情怀应助科研通管家采纳,获得10
7秒前
顾矜应助科研通管家采纳,获得10
7秒前
7秒前
7秒前
arniu2008应助科研通管家采纳,获得20
7秒前
科研通AI2S应助科研通管家采纳,获得10
7秒前
科研通AI6.4应助科研通管家采纳,获得150
7秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Cronologia da história de Macau 5000
Petrology and Plate Tectonics 800
Electrode Potentials 550
Matrix Methods in Data Mining and Pattern Recognition 510
Trees of tropical Asia : an illustrated guide to diversity 500
Materials Informatics Molecules, Crystals and Beyond A volume in Acta Materialia Book Series 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7045559
求助须知:如何正确求助?哪些是违规求助? 8711747
关于积分的说明 18447051
捐赠科研通 6559072
什么是DOI,文献DOI怎么找? 3118247
关于科研通互助平台的介绍 2203807
邀请新用户注册赠送积分活动 2093666