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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
CcC应助zxx采纳,获得10
刚刚
王了个小婷完成签到 ,获得积分10
刚刚
leo完成签到,获得积分10
1秒前
海阔天空完成签到 ,获得积分0
5秒前
6秒前
鱿鱼炒黄瓜完成签到,获得积分10
8秒前
青平完成签到 ,获得积分10
9秒前
9秒前
迷路凌柏完成签到 ,获得积分10
10秒前
墨林云海完成签到,获得积分10
11秒前
任迷迷完成签到 ,获得积分10
12秒前
小手冰凉完成签到 ,获得积分10
13秒前
兰战非完成签到 ,获得积分10
14秒前
唐陌完成签到 ,获得积分10
14秒前
15秒前
豆豆完成签到 ,获得积分10
16秒前
夜雨完成签到 ,获得积分10
18秒前
梅梅完成签到 ,获得积分10
18秒前
8D完成签到,获得积分10
19秒前
脑子空空完成签到 ,获得积分10
24秒前
冷傲的宛白完成签到,获得积分10
24秒前
Kao应助zxx采纳,获得10
25秒前
SHI完成签到 ,获得积分10
28秒前
28秒前
有何可不完成签到,获得积分10
31秒前
mou完成签到,获得积分10
33秒前
科研通AI6.3应助123456采纳,获得10
33秒前
zyw完成签到 ,获得积分10
36秒前
36秒前
ivy发布了新的文献求助30
37秒前
39秒前
尊敬的小凡完成签到,获得积分10
42秒前
42秒前
朴实涵山完成签到 ,获得积分10
48秒前
Kao应助zxx采纳,获得10
49秒前
123456发布了新的文献求助10
49秒前
53秒前
丁小二完成签到 ,获得积分10
53秒前
坚强白容完成签到,获得积分10
54秒前
酷炫甜瓜完成签到,获得积分10
55秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 1000
Weaponeering: An Introduction Fourth Edition, Volume 1 1000
Advanced Weaponeering Fourth Edition, Volume 2 1000
Evidence Summary. Injection (subcutaneous):op- timal administration 1000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7497525
求助须知:如何正确求助?哪些是违规求助? 9088395
关于积分的说明 19383492
捐赠科研通 7107959
什么是DOI,文献DOI怎么找? 3250219
关于科研通互助平台的介绍 2419664
邀请新用户注册赠送积分活动 2235989