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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
传奇3应助憨憨采纳,获得10
2秒前
火力全开完成签到,获得积分10
3秒前
木齐Jay发布了新的文献求助10
3秒前
李健的小迷弟应助ALITTLE采纳,获得20
3秒前
3秒前
luxia完成签到 ,获得积分10
4秒前
田様应助傻子不会科研采纳,获得10
4秒前
谨慎长颈鹿完成签到,获得积分10
4秒前
5秒前
田様应助小肥肉采纳,获得10
5秒前
qh完成签到,获得积分10
5秒前
小怪完成签到,获得积分10
5秒前
大力的灵雁应助ther采纳,获得20
7秒前
666发布了新的文献求助10
8秒前
CodeCraft应助baining采纳,获得10
9秒前
Hello应助雨臼采纳,获得10
10秒前
研友_ndvWy8完成签到,获得积分10
11秒前
11秒前
12秒前
Renhc完成签到,获得积分10
13秒前
冰冰发布了新的文献求助10
14秒前
15秒前
失落沙洲应助zengzeng采纳,获得10
15秒前
料峭声花发布了新的文献求助10
16秒前
深情安青应助sunshine采纳,获得10
16秒前
17秒前
张艺凡完成签到,获得积分10
17秒前
烟花应助小肥羊采纳,获得10
17秒前
19秒前
暴走小面包完成签到 ,获得积分10
20秒前
娜娜梨完成签到,获得积分20
20秒前
20秒前
1580071102完成签到,获得积分10
21秒前
anpucle发布了新的文献求助10
22秒前
22秒前
23秒前
23秒前
和花花发布了新的文献求助10
23秒前
24秒前
27秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Inorganic Chemistry Eighth Edition 1200
Free parameter models in liquid scintillation counting 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
HANDBOOK OF CHEMISTRY AND PHYSICS 106th edition 1000
ASPEN Adult Nutrition Support Core Curriculum, Fourth Edition 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6312486
求助须知:如何正确求助?哪些是违规求助? 8129055
关于积分的说明 17034632
捐赠科研通 5369496
什么是DOI,文献DOI怎么找? 2850872
邀请新用户注册赠送积分活动 1828658
关于科研通互助平台的介绍 1680943