清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
liangchenglyu发布了新的文献求助30
1秒前
FashionBoy应助欧欧拉格朗日采纳,获得10
5秒前
甜蜜的紫菜完成签到,获得积分10
6秒前
15秒前
LJ_2完成签到 ,获得积分0
16秒前
21秒前
源正生物完成签到 ,获得积分10
27秒前
钉钉完成签到 ,获得积分10
34秒前
38秒前
42秒前
Pami发布了新的文献求助10
44秒前
deng完成签到 ,获得积分10
47秒前
阿星发布了新的文献求助10
49秒前
沉默的樱完成签到,获得积分10
50秒前
jyy发布了新的文献求助30
56秒前
自然亦凝完成签到,获得积分10
1分钟前
1分钟前
lili应助科研通管家采纳,获得30
1分钟前
廖道罡完成签到,获得积分10
1分钟前
金鱼完成签到 ,获得积分10
1分钟前
温柔山槐完成签到 ,获得积分10
1分钟前
ZhongFei发布了新的文献求助10
1分钟前
DHW1703701完成签到,获得积分0
1分钟前
李健的小迷弟应助ZhongFei采纳,获得10
1分钟前
时尚的访琴完成签到 ,获得积分10
1分钟前
风趣的香岚完成签到,获得积分10
1分钟前
舒适的采波完成签到 ,获得积分10
2分钟前
jiaojiao完成签到 ,获得积分10
2分钟前
cqk123应助Lny采纳,获得10
2分钟前
MM完成签到 ,获得积分10
2分钟前
小巧惜蕊完成签到,获得积分10
2分钟前
Andy完成签到 ,获得积分10
2分钟前
幸福的疾完成签到,获得积分10
2分钟前
含糊的铃铛完成签到 ,获得积分10
2分钟前
林海完成签到 ,获得积分10
3分钟前
Ray完成签到 ,获得积分10
3分钟前
JamesPei应助梦罪者采纳,获得10
3分钟前
蚂蚁飞飞完成签到,获得积分10
3分钟前
瘦瘦的如冰完成签到,获得积分10
3分钟前
cat应助Pami采纳,获得10
3分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
An Introduction to Foreign Language Learning and Teaching 750
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Les chinois de jakarta: temples et vie collective 500
Governing Growth: Us Industrial Policy from Hamilton to Trump 500
The fast track to determining transfer functions of linear circuits: The student guide 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7627175
求助须知:如何正确求助?哪些是违规求助? 9201730
关于积分的说明 19728128
捐赠科研通 7197261
什么是DOI,文献DOI怎么找? 3273838
关于科研通互助平台的介绍 2436127
邀请新用户注册赠送积分活动 2269907