Copula entropy-based golden jackal optimization algorithm for high-dimensional feature selection problems

计算机科学 特征选择 算法 元启发式 人工智能 维数之咒 局部最优 水准点(测量) 机器学习 数据挖掘 大地测量学 地理
作者
Heba Askr,Mahmoud Abdel-Salam,Aboul Ella Hassanien
出处
期刊:Expert Systems With Applications [Elsevier BV]
卷期号:238: 121582-121582 被引量:38
标识
DOI:10.1016/j.eswa.2023.121582
摘要

Feature selection (FS) is a crucial process that aims to remove unnecessary features from datasets. It plays a role in data mining and machine learning (ML) by reducing the risk associated with high-dimensional datasets. FS is considered a challenging problem that is difficult to solve efficiently due to its combinatorial nature. As the size of the problem increases, the computation time also grows. Recently, researchers have focused on metaheuristic FS algorithms specifically designed for high-dimensional datasets. Therefore, this article proposes a powerful metaheuristic algorithm called Binary Enhanced Golden Jackal Optimization (BEGJO), which is an improved version of the recently published Golden Jackal Optimization (GJO) algorithm. The original GJO algorithm faces challenges when dealing with high-dimensional FS problems, as it tends to get trapped in local optima. To address this issue, various enhancement strategies are employed to improve the efficiency of GJO. The proposed BEGJO algorithm utilizes Copula Entropy (CE) to reduce the dimensionality of high-dimensional FS problems while maintaining high classification accuracy using the K-Nearest Neighbour (K-NN) classifier. Additionally, four enhancement strategies are incorporated to enhance the exploration and exploitation capabilities of the fundamental GJO algorithm. The BEGJO algorithm is transformed into its binary form using the sigmoid transfer function, aligning it with the nature of the FS problem. It is then tested on various high-dimensional benchmark datasets. The effectiveness of BEGJO is evaluated by comparing it with well-known algorithms in terms of classification accuracy, feature dimension, and processing time. BEGJO outperforms other algorithms in terms of classification accuracy and feature dimension and ranks up to fourth in terms of processing time. Furthermore, the advantageous use of CE is demonstrated by comparing the performance of the proposed algorithm with traditional FS algorithms. Statistical evaluations are conducted to further validate the effectiveness and superiority of the proposed algorithm. The results confirm that BEGJO is an effective solution for high-dimensional FS problems.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
奋斗的雪曼完成签到 ,获得积分10
5秒前
粗心的飞槐完成签到 ,获得积分10
5秒前
LELE完成签到 ,获得积分10
12秒前
了0完成签到 ,获得积分10
13秒前
apocalypse完成签到 ,获得积分10
18秒前
guhao完成签到 ,获得积分10
19秒前
指导灰完成签到 ,获得积分10
19秒前
善良的火完成签到 ,获得积分10
30秒前
优雅夕阳完成签到 ,获得积分10
32秒前
Jasper应助光亮的自行车采纳,获得10
32秒前
miki完成签到,获得积分10
33秒前
量子星尘发布了新的文献求助10
34秒前
糖宝完成签到 ,获得积分10
41秒前
KX2024完成签到,获得积分10
44秒前
松松发布了新的文献求助20
47秒前
nusiew完成签到,获得积分10
47秒前
huiluowork完成签到 ,获得积分10
48秒前
陶醉的翠霜完成签到 ,获得积分10
48秒前
48秒前
冷静如松完成签到 ,获得积分10
55秒前
57秒前
浮云完成签到 ,获得积分10
58秒前
屈岂愈完成签到,获得积分10
59秒前
1分钟前
Pupil完成签到,获得积分10
1分钟前
偏偏意气用事完成签到,获得积分10
1分钟前
安安完成签到,获得积分10
1分钟前
cttc完成签到,获得积分10
1分钟前
Chnimike完成签到 ,获得积分10
1分钟前
1分钟前
红茸茸羊完成签到 ,获得积分10
1分钟前
年轻千愁完成签到 ,获得积分10
1分钟前
liu完成签到,获得积分10
1分钟前
量子星尘发布了新的文献求助10
1分钟前
Wanyeweiyu完成签到,获得积分10
1分钟前
Fury完成签到 ,获得积分10
1分钟前
风中幻梦完成签到,获得积分10
1分钟前
bigpluto完成签到,获得积分10
1分钟前
1分钟前
是谁还没睡完成签到 ,获得积分10
1分钟前
高分求助中
【提示信息,请勿应助】关于scihub 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
徐淮辽南地区新元古代叠层石及生物地层 3000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Handbook of Industrial Diamonds.Vol2 1100
Global Eyelash Assessment scale (GEA) 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 550
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038066
求助须知:如何正确求助?哪些是违规求助? 3575779
关于积分的说明 11373801
捐赠科研通 3305584
什么是DOI,文献DOI怎么找? 1819239
邀请新用户注册赠送积分活动 892655
科研通“疑难数据库(出版商)”最低求助积分说明 815022