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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Epiphany完成签到,获得积分10
刚刚
正直的怜菡完成签到,获得积分10
刚刚
龙猫抱枕发布了新的文献求助20
刚刚
无名的人完成签到,获得积分10
1秒前
torch132完成签到,获得积分0
1秒前
1秒前
秦艽完成签到,获得积分10
1秒前
干净的沛蓝完成签到,获得积分10
2秒前
hu发布了新的文献求助10
2秒前
赘婿应助呆萌麦片采纳,获得10
2秒前
千寻完成签到,获得积分20
2秒前
杨修完成签到,获得积分10
3秒前
lzhgoashore完成签到,获得积分10
3秒前
3秒前
mm完成签到,获得积分10
4秒前
华北走地鸡完成签到,获得积分10
4秒前
聂雨声完成签到,获得积分10
4秒前
5秒前
5秒前
5秒前
幽默的棒球完成签到,获得积分10
6秒前
华仔应助mach采纳,获得10
6秒前
清风朗月完成签到,获得积分10
6秒前
小小蚂蚁完成签到,获得积分10
7秒前
爱爱精神境界完成签到,获得积分10
7秒前
shanrong完成签到,获得积分10
7秒前
炙热的笑翠完成签到,获得积分10
7秒前
上官若男应助科研通管家采纳,获得10
8秒前
liz完成签到,获得积分10
8秒前
8秒前
思源应助xhh采纳,获得10
8秒前
乐乐应助科研通管家采纳,获得10
8秒前
彭于晏应助科研通管家采纳,获得10
9秒前
李爱国应助科研通管家采纳,获得30
9秒前
9秒前
斯文败类应助科研通管家采纳,获得10
9秒前
小满完成签到 ,获得积分10
9秒前
CX完成签到,获得积分10
9秒前
小小应助科研通管家采纳,获得30
10秒前
cdercder应助科研通管家采纳,获得10
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Cronologia da história de Macau 5000
Petrology and Plate Tectonics 800
Prompt Engineering for Clinicians: Harnessing AI in Everyday Medical Practice 600
Electrode Potentials 550
Handbook Of Synthetic Methodologies And Protocols Of Nanomaterials 500
Trees of tropical Asia : an illustrated guide to diversity 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 光电子学 物理化学 电极 基因 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 6990983
求助须知:如何正确求助?哪些是违规求助? 8667773
关于积分的说明 18376069
捐赠科研通 6461766
什么是DOI,文献DOI怎么找? 3096919
关于科研通互助平台的介绍 2158161
邀请新用户注册赠送积分活动 2073261