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]
卷期号: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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
顾矜应助科研通管家采纳,获得10
1秒前
桐桐应助科研通管家采纳,获得10
1秒前
CipherSage应助科研通管家采纳,获得10
1秒前
1秒前
1秒前
深情安青应助科研通管家采纳,获得10
1秒前
无极微光应助科研通管家采纳,获得20
1秒前
bkagyin应助科研通管家采纳,获得10
1秒前
KLAY应助科研通管家采纳,获得10
1秒前
我是老大应助科研通管家采纳,获得10
1秒前
tiptip应助科研通管家采纳,获得10
2秒前
迷路的啤酒完成签到 ,获得积分10
2秒前
2秒前
顾矜应助科研通管家采纳,获得10
2秒前
yuanyuan发布了新的文献求助10
2秒前
杨廷友发布了新的文献求助10
2秒前
3秒前
NattyPoe发布了新的文献求助10
4秒前
科研通AI6.4应助yuanyuan采纳,获得10
5秒前
6秒前
6秒前
jeeya完成签到,获得积分10
6秒前
zzt完成签到,获得积分10
7秒前
洋1发布了新的文献求助10
7秒前
FashionBoy应助杨廷友采纳,获得10
7秒前
冷艳雪碧发布了新的文献求助10
8秒前
科研通AI6.4应助俏皮沁采纳,获得10
8秒前
陈慕枫发布了新的文献求助10
11秒前
11秒前
aayu完成签到,获得积分20
11秒前
高大晓丝完成签到 ,获得积分10
11秒前
MM发布了新的文献求助20
11秒前
闪闪棉花糖完成签到,获得积分10
12秒前
清蒸可达鸭应助关畅澎采纳,获得10
15秒前
科研通AI6.1应助山山而川采纳,获得10
15秒前
在水一方应助烤冷面采纳,获得10
15秒前
陈慕枫完成签到,获得积分10
15秒前
CodeCraft应助yangon采纳,获得10
16秒前
科研新兵完成签到,获得积分10
16秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Relation between chemical structure and local anesthetic action: tertiary alkylamine derivatives of diphenylhydantoin 1000
Signals, Systems, and Signal Processing 610
Discrete-Time Signals and Systems 610
Principles of town planning : translating concepts to applications 500
Iron‐Sulfur Clusters: Biogenesis and Biochemistry 400
Healable Polymer Systems: Fundamentals, Synthesis and Applications 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 物理 生物化学 化学工程 计算机科学 复合材料 内科学 催化作用 光电子学 物理化学 电极 冶金 遗传学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 6071420
求助须知:如何正确求助?哪些是违规求助? 7902906
关于积分的说明 16339834
捐赠科研通 5211738
什么是DOI,文献DOI怎么找? 2787534
邀请新用户注册赠送积分活动 1770255
关于科研通互助平台的介绍 1648148