已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
wwwww完成签到 ,获得积分10
2秒前
3秒前
answer应助niuniuniu采纳,获得10
3秒前
4秒前
小马甲应助何土旦采纳,获得10
5秒前
树脂小柴发布了新的文献求助10
9秒前
着急的一曲完成签到 ,获得积分10
11秒前
我是老大应助爱sun采纳,获得10
12秒前
向媛完成签到,获得积分10
13秒前
Nexus应助zhaideqi7采纳,获得10
15秒前
SciGPT应助zhaideqi7采纳,获得10
15秒前
羊屎蛋完成签到 ,获得积分10
15秒前
AAA发布了新的文献求助10
16秒前
蒋蒋完成签到 ,获得积分10
17秒前
如初完成签到 ,获得积分10
17秒前
yyyfff完成签到,获得积分20
17秒前
18秒前
18秒前
yn关闭了yn文献求助
19秒前
香蕉耳机完成签到 ,获得积分10
19秒前
传奇3应助炙热香采纳,获得10
22秒前
22秒前
爱sun发布了新的文献求助10
24秒前
yoruyik完成签到 ,获得积分10
24秒前
SciGPT应助感动的银耳汤采纳,获得10
26秒前
大力的灵雁应助anthony采纳,获得10
29秒前
茶壶喝茶发布了新的文献求助10
30秒前
kytzh完成签到,获得积分10
30秒前
32秒前
wanci应助yyyfff采纳,获得10
32秒前
楚琦发布了新的文献求助20
34秒前
35秒前
1122完成签到 ,获得积分10
37秒前
炙热香发布了新的文献求助10
38秒前
学习完成签到,获得积分10
39秒前
41秒前
42秒前
小航完成签到 ,获得积分10
43秒前
香蕉觅云应助AAA采纳,获得10
44秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Applied Min-Max Approach to Missile Guidance and Control 5000
Metallurgy at high pressures and high temperatures 2000
Inorganic Chemistry Eighth Edition 1200
The Organic Chemistry of Biological Pathways Second Edition 1000
Anionic polymerization of acenaphthylene: identification of impurity species formed as by-products 1000
Standards for Molecular Testing for Red Cell, Platelet, and Neutrophil Antigens, 7th edition 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6325506
求助须知:如何正确求助?哪些是违规求助? 8141577
关于积分的说明 17070323
捐赠科研通 5378020
什么是DOI,文献DOI怎么找? 2854059
邀请新用户注册赠送积分活动 1831718
关于科研通互助平台的介绍 1682768