基于多目标加权适应度函数的遗传算法和灰狼优化器在机器学习分类中提高效率的实证分析:路线图

IF 1.7 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Journal of Experimental & Theoretical Artificial Intelligence Pub Date : 2022-02-13 DOI:10.1080/0952813X.2021.1960627
Azam Davahli, M. Shamsi, Golnoush Abaei, Arash Khosravi
{"title":"基于多目标加权适应度函数的遗传算法和灰狼优化器在机器学习分类中提高效率的实证分析:路线图","authors":"Azam Davahli, M. Shamsi, Golnoush Abaei, Arash Khosravi","doi":"10.1080/0952813X.2021.1960627","DOIUrl":null,"url":null,"abstract":"ABSTRACT Feature selection (FS) is an optimisation problem that reduces the dimension of the dataset and increases the performance of the machine learning algorithms and classification through the selection of the optimal subset features and elimination of the redundant features. However, the huge search space is an important challenge in the FS problem. Due to their satisfactory capabilities to handle high-dimension search spaces, meta-heuristic search algorithms have recently gained much attention and become popular in the FS problem. For these algorithms, choosing a proper fitness function plays an important role. The fitness function orients the searching strategy of the algorithms to obtain best solutions. Appropriate fitness functions will help the algorithms with exploring the search space more effectively and efficiently. In this work, firstly the efficiency of two of the most outstanding and successful heuristic algorithms in the FS domain, namely genetic algorithm (GA) and grey wolf optimiser (GWO), are investigated and analysed with a single-objective fitness function. Secondly, two recent feature selection techniques based on GA and GWO, namely feature selection, weight, and parameter optimisation (FWP) and binary GWO (BGWO) with their fitness function are investigated and analysed. Thirdly, in order to remove the detected drawbacks and weaknesses of the FS algorithms and to enhance their efficiency, a new multi-objective weighted fitness function based on multiple predominant criteria has been presented. The effectiveness of the proposed fitness function on the FS algorithms is evaluated by using SVM and associative classification on 11 different large and small datasets. The experimental results show the superiority of proposed fitness function (where features were reduced and the classification performance has been improved) over single-objective fitness function and other existing fitness functions. Furthermore, another key aim of this study is to present a comprehensive study about the strengths and weaknesses of the FS algorithms which can be used as guidelines for future possible works to more improve the developments of these algorithms.","PeriodicalId":15677,"journal":{"name":"Journal of Experimental & Theoretical Artificial Intelligence","volume":"8 1","pages":"171 - 206"},"PeriodicalIF":1.7000,"publicationDate":"2022-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Empirical analyses of genetic algorithm and grey wolf optimiser to improve their efficiency with a new multi-objective weighted fitness function for feature selection in machine learning classification: the roadmap\",\"authors\":\"Azam Davahli, M. Shamsi, Golnoush Abaei, Arash Khosravi\",\"doi\":\"10.1080/0952813X.2021.1960627\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Feature selection (FS) is an optimisation problem that reduces the dimension of the dataset and increases the performance of the machine learning algorithms and classification through the selection of the optimal subset features and elimination of the redundant features. However, the huge search space is an important challenge in the FS problem. Due to their satisfactory capabilities to handle high-dimension search spaces, meta-heuristic search algorithms have recently gained much attention and become popular in the FS problem. For these algorithms, choosing a proper fitness function plays an important role. The fitness function orients the searching strategy of the algorithms to obtain best solutions. Appropriate fitness functions will help the algorithms with exploring the search space more effectively and efficiently. In this work, firstly the efficiency of two of the most outstanding and successful heuristic algorithms in the FS domain, namely genetic algorithm (GA) and grey wolf optimiser (GWO), are investigated and analysed with a single-objective fitness function. Secondly, two recent feature selection techniques based on GA and GWO, namely feature selection, weight, and parameter optimisation (FWP) and binary GWO (BGWO) with their fitness function are investigated and analysed. Thirdly, in order to remove the detected drawbacks and weaknesses of the FS algorithms and to enhance their efficiency, a new multi-objective weighted fitness function based on multiple predominant criteria has been presented. The effectiveness of the proposed fitness function on the FS algorithms is evaluated by using SVM and associative classification on 11 different large and small datasets. The experimental results show the superiority of proposed fitness function (where features were reduced and the classification performance has been improved) over single-objective fitness function and other existing fitness functions. Furthermore, another key aim of this study is to present a comprehensive study about the strengths and weaknesses of the FS algorithms which can be used as guidelines for future possible works to more improve the developments of these algorithms.\",\"PeriodicalId\":15677,\"journal\":{\"name\":\"Journal of Experimental & Theoretical Artificial Intelligence\",\"volume\":\"8 1\",\"pages\":\"171 - 206\"},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2022-02-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Experimental & Theoretical Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1080/0952813X.2021.1960627\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Experimental & Theoretical Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1080/0952813X.2021.1960627","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 2

摘要

特征选择(FS)是一个优化问题,它通过选择最优子集特征和消除冗余特征来降低数据集的维数,提高机器学习算法和分类的性能。然而,巨大的搜索空间是FS问题的一个重要挑战。元启发式搜索算法由于其处理高维搜索空间的令人满意的能力,近年来在FS问题中得到了广泛的关注和应用。在这些算法中,选择合适的适应度函数起着重要的作用。适应度函数指导算法的搜索策略以获得最优解。适当的适应度函数有助于算法更有效地探索搜索空间。本文首先利用单目标适应度函数对遗传算法(genetic algorithm, GA)和灰狼优化器(grey wolf optimizer, GWO)这两种最成功的启发式算法的效率进行了研究和分析。其次,研究了基于遗传算法和GWO的两种最新特征选择技术,即特征选择、权重和参数优化(FWP)和带适应度函数的二元GWO (BGWO)。第三,为了消除现有的多目标加权适应度算法存在的缺陷和不足,提高算法的效率,提出了一种基于多优准则的多目标加权适应度函数。通过在11个不同的大小数据集上使用支持向量机和关联分类来评估所提出的适应度函数对FS算法的有效性。实验结果表明,本文提出的适应度函数(减少了特征,提高了分类性能)优于单目标适应度函数和其他现有适应度函数。此外,本研究的另一个关键目的是对FS算法的优缺点进行全面研究,这可以作为未来可能工作的指导方针,以进一步改进这些算法的发展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Empirical analyses of genetic algorithm and grey wolf optimiser to improve their efficiency with a new multi-objective weighted fitness function for feature selection in machine learning classification: the roadmap
ABSTRACT Feature selection (FS) is an optimisation problem that reduces the dimension of the dataset and increases the performance of the machine learning algorithms and classification through the selection of the optimal subset features and elimination of the redundant features. However, the huge search space is an important challenge in the FS problem. Due to their satisfactory capabilities to handle high-dimension search spaces, meta-heuristic search algorithms have recently gained much attention and become popular in the FS problem. For these algorithms, choosing a proper fitness function plays an important role. The fitness function orients the searching strategy of the algorithms to obtain best solutions. Appropriate fitness functions will help the algorithms with exploring the search space more effectively and efficiently. In this work, firstly the efficiency of two of the most outstanding and successful heuristic algorithms in the FS domain, namely genetic algorithm (GA) and grey wolf optimiser (GWO), are investigated and analysed with a single-objective fitness function. Secondly, two recent feature selection techniques based on GA and GWO, namely feature selection, weight, and parameter optimisation (FWP) and binary GWO (BGWO) with their fitness function are investigated and analysed. Thirdly, in order to remove the detected drawbacks and weaknesses of the FS algorithms and to enhance their efficiency, a new multi-objective weighted fitness function based on multiple predominant criteria has been presented. The effectiveness of the proposed fitness function on the FS algorithms is evaluated by using SVM and associative classification on 11 different large and small datasets. The experimental results show the superiority of proposed fitness function (where features were reduced and the classification performance has been improved) over single-objective fitness function and other existing fitness functions. Furthermore, another key aim of this study is to present a comprehensive study about the strengths and weaknesses of the FS algorithms which can be used as guidelines for future possible works to more improve the developments of these algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
6.10
自引率
4.50%
发文量
89
审稿时长
>12 weeks
期刊介绍: Journal of Experimental & Theoretical Artificial Intelligence (JETAI) is a world leading journal dedicated to publishing high quality, rigorously reviewed, original papers in artificial intelligence (AI) research. The journal features work in all subfields of AI research and accepts both theoretical and applied research. Topics covered include, but are not limited to, the following: • cognitive science • games • learning • knowledge representation • memory and neural system modelling • perception • problem-solving
期刊最新文献
Occlusive target recognition method of sorting robot based on anchor-free detection network An effectual underwater image enhancement framework using adaptive trans-resunet ++ with attention mechanism An experimental study of sentiment classification using deep-based models with various word embedding techniques Sign language video to text conversion via optimised LSTM with improved motion estimation An efficient safest route prediction-based route discovery mechanism for drivers using improved golden tortoise beetle optimizer
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1