Arid
DOI10.1002/cpe.6524
Namib beetle optimization algorithm: A new meta-heuristic method for feature selection and dimension reduction
Chahardoli, Meysam; Eraghi, Nafiseh Osati; Nazari, Sara
通讯作者Chahardoli, M (corresponding author), Islamic Azad Univ, Arak Branch, Comp Engn Dept, Arak, Iran.
来源期刊CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
ISSN1532-0626
EISSN1532-0634
出版年2021-08
英文摘要Today, large amounts of data are generated in various applications such as smart cities and social networks, and their processing requires a lot of time. One of the methods of processing data types and reducing computational time on data is the use of dimension reduction methods. Reducing dimensions is a problem with the optimization approach and meta-heuristic methods can be used to solve it. Namib beetles are an example of intelligent insects and creatures in nature that use an interesting strategy to survive and collect water in the desert. In this article, the behavior of Namib beetles has been used to collect water in the desert to model the Namib beetle optimization (NBO) algorithm. In the second phase of a binary version, this algorithm is used to select features and reduce dimensions. Experiments on CEC functions show that the proposed method has fewer errors than the DE, BBO, SHO, WOA, GOA, and HHO algorithms. In large dimensions such as 200, 500, and 1000 dimensions, the NBO algorithm of meta-heuristic algorithms such as HHO and WOA has a better rank in the optimal calculation of benchmark functions. Experiments show that the proposed algorithm has a greater ability to reduce dimensions and feature selection than similar meta-heuristic algorithms. In 87.5% of the experiments, the proposed method reduces the data space more than other compared methods.
英文关键词dimension reduction feature selection meta-heuristic algorithm Namib beetle optimization (NBO) optimization
类型Article ; Early Access
语种英语
收录类别SCI-E
WOS记录号WOS:000688265700001
WOS类目Computer Science, Software Engineering ; Computer Science, Theory & Methods
WOS研究方向Computer Science
资源类型期刊论文
条目标识符http://119.78.100.177/qdio/handle/2XILL650/362901
作者单位[Chahardoli, Meysam; Eraghi, Nafiseh Osati; Nazari, Sara] Islamic Azad Univ, Arak Branch, Comp Engn Dept, Arak, Iran
推荐引用方式
GB/T 7714
Chahardoli, Meysam,Eraghi, Nafiseh Osati,Nazari, Sara. Namib beetle optimization algorithm: A new meta-heuristic method for feature selection and dimension reduction[J],2021.
APA Chahardoli, Meysam,Eraghi, Nafiseh Osati,&Nazari, Sara.(2021).Namib beetle optimization algorithm: A new meta-heuristic method for feature selection and dimension reduction.CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE.
MLA Chahardoli, Meysam,et al."Namib beetle optimization algorithm: A new meta-heuristic method for feature selection and dimension reduction".CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE (2021).
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Chahardoli, Meysam]的文章
[Eraghi, Nafiseh Osati]的文章
[Nazari, Sara]的文章
百度学术
百度学术中相似的文章
[Chahardoli, Meysam]的文章
[Eraghi, Nafiseh Osati]的文章
[Nazari, Sara]的文章
必应学术
必应学术中相似的文章
[Chahardoli, Meysam]的文章
[Eraghi, Nafiseh Osati]的文章
[Nazari, Sara]的文章
相关权益政策
暂无数据
收藏/分享

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。