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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
2秒前
英吉利25发布了新的文献求助10
3秒前
5秒前
石先敏完成签到 ,获得积分10
6秒前
9秒前
13秒前
16秒前
Jasper应助猪猪hero采纳,获得10
19秒前
19秒前
旺旺完成签到,获得积分10
20秒前
可靠铸海应助ho采纳,获得30
20秒前
会做饭的外星人完成签到 ,获得积分10
21秒前
23秒前
韩钰小宝完成签到 ,获得积分10
25秒前
英吉利25发布了新的文献求助10
29秒前
蓝精灵完成签到 ,获得积分10
29秒前
照亮世界的ay完成签到,获得积分10
30秒前
31秒前
JJZ完成签到,获得积分10
32秒前
大月儿完成签到 ,获得积分10
34秒前
34秒前
猪猪hero发布了新的文献求助10
35秒前
39秒前
43秒前
泥嚎完成签到,获得积分10
47秒前
47秒前
穿堂风完成签到,获得积分10
50秒前
猪猪hero发布了新的文献求助10
50秒前
香蕉新儿完成签到,获得积分10
51秒前
51秒前
Natforever发布了新的文献求助10
53秒前
cdercder应助科研通管家采纳,获得10
55秒前
cdercder应助科研通管家采纳,获得10
55秒前
cdercder应助科研通管家采纳,获得10
56秒前
cdercder应助科研通管家采纳,获得10
56秒前
cdercder应助科研通管家采纳,获得10
56秒前
1分钟前
明亮的小兔子完成签到 ,获得积分10
1分钟前
123完成签到 ,获得积分10
1分钟前
流星雨完成签到 ,获得积分10
1分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Health Psychology 600
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
When Is Two-Stage Sample Robust Optimization Asymptotically Optimal? 500
APA handbook of comparative psychology: Basic concepts, methods, neural substrate, and behavior 500
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7592433
求助须知:如何正确求助?哪些是违规求助? 9169693
关于积分的说明 19626130
捐赠科研通 7170493
什么是DOI,文献DOI怎么找? 3267514
关于科研通互助平台的介绍 2432371
邀请新用户注册赠送积分活动 2260009