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
刚刚
4秒前
分析发布了新的文献求助10
5秒前
6秒前
arniu2008应助zby采纳,获得20
6秒前
无极微光应助科研通管家采纳,获得20
6秒前
思源应助从容迎曼采纳,获得10
6秒前
无极微光应助科研通管家采纳,获得20
6秒前
CipherSage应助科研通管家采纳,获得10
6秒前
Copyright应助科研通管家采纳,获得10
6秒前
FashionBoy应助科研通管家采纳,获得10
7秒前
Owen应助科研通管家采纳,获得10
7秒前
今后应助科研通管家采纳,获得10
7秒前
7秒前
Hello应助科研通管家采纳,获得30
7秒前
7秒前
SciGPT应助科研通管家采纳,获得10
7秒前
Ava应助科研通管家采纳,获得10
7秒前
Orange应助xxl采纳,获得10
8秒前
10秒前
姚序东完成签到,获得积分10
11秒前
11秒前
fofo关注了科研通微信公众号
11秒前
jindou完成签到,获得积分10
12秒前
13秒前
13秒前
14秒前
14秒前
搞怪巧克力卷卷心完成签到,获得积分10
14秒前
kxz完成签到 ,获得积分10
16秒前
共享精神应助含蓄的煜城采纳,获得10
17秒前
顺心谷冬完成签到 ,获得积分10
18秒前
leez发布了新的文献求助10
19秒前
小思雅完成签到,获得积分10
20秒前
李佳笑发布了新的文献求助10
20秒前
XYZ发布了新的文献求助10
21秒前
21秒前
之华完成签到,获得积分10
25秒前
25秒前
fofo发布了新的文献求助10
26秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Development of a Bridge Weigh-In-Motion System: A technology to convert the bridge response to the passage of traffic into data on vehicle configurations, speeds, times of travel and weights 1000
Molecular Mechanisms of Photosynthesis, 4th Edition 1000
Organic Reactions, Volume 116 1000
Current concepts in cutaneous toxicity : proceedings of the Fourth Conference on Cutaneous Toxicity, Washington, D.C., May 9-11, 1979 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7262045
求助须知:如何正确求助?哪些是违规求助? 8883453
关于积分的说明 18773671
捐赠科研通 6941305
什么是DOI,文献DOI怎么找? 3202400
关于科研通互助平台的介绍 2375640
邀请新用户注册赠送积分活动 2178075