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秒前
十三应助ginger采纳,获得10
1秒前
zhugepengju发布了新的文献求助10
2秒前
冷落清秋发布了新的文献求助30
2秒前
华仔应助救赎采纳,获得10
2秒前
3秒前
3秒前
4秒前
藤藤菜应助老迟到的念文采纳,获得50
4秒前
孤独的迎滑完成签到,获得积分10
5秒前
5秒前
suntreenew完成签到,获得积分20
5秒前
coco完成签到,获得积分10
6秒前
7秒前
打打应助傻呀吧采纳,获得10
7秒前
7秒前
8秒前
树上的哚吡完成签到,获得积分10
8秒前
奋斗灵珊发布了新的文献求助10
8秒前
潇洒山水完成签到,获得积分10
9秒前
Muller完成签到,获得积分10
9秒前
刘菲特1发布了新的文献求助10
9秒前
10秒前
ypj发布了新的文献求助10
10秒前
wn_xx_wn完成签到,获得积分10
10秒前
桐桐应助horizon321采纳,获得10
11秒前
守培发布了新的文献求助10
11秒前
endlessloop发布了新的文献求助10
12秒前
12秒前
savior发布了新的文献求助10
12秒前
12秒前
cqk123应助ginger采纳,获得10
12秒前
13秒前
coco发布了新的文献求助10
13秒前
13秒前
慕青应助实验昏了头采纳,获得10
14秒前
power完成签到 ,获得积分10
14秒前
hunter完成签到 ,获得积分10
15秒前
Chunxue发布了新的文献求助10
15秒前
芷诺发布了新的文献求助30
15秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 2000
Advanced Weaponeering Fourth Edition, Volume 2 1000
Weaponeering: An Introduction Fourth Edition, Volume 1 1000
Curating Socialism: A Handbook of International Art Exhibitions 1947-1989 750
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7533496
求助须知:如何正确求助?哪些是违规求助? 9119044
关于积分的说明 19480196
捐赠科研通 7133247
什么是DOI,文献DOI怎么找? 3256951
关于科研通互助平台的介绍 2424388
邀请新用户注册赠送积分活动 2244665