版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Al Balqa Appl Univ Salt Jordan Al Aqsa Univ Dept Comp Sci Gaza Palestine Yarmouk Univ Comp Engn Dept Irbid Jordan Al Balqa Appl Univ Dept Comp Informat Syst Salt Jordan Linkoping Univ Dept Comp & Informat Sci Linkoping Sweden Fayoum Univ Fac Sci Faiyum Egypt Appl Sci Private Univ Appl Sci Res Ctr Amman 11931 Jordan Middle East Univ MEU Res Unit Amman 11831 Jordan Ajman Univ Artificial Intelligence Res Ctr AIRC Ajman U Arab Emirates
出 版 物:《CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS》 (簇计算)
年 卷 期:2024年第27卷第8期
页 面:10487-10523页
核心收录:
学科分类:07[理学] 0703[理学-化学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:High-dimensional features AFT algorithm Feature selection Optimization
摘 要:High-dimensional Feature Selection Problems (HFSPs) have grown in popularity but remain challenging. When faced with such complex situations, the majority of currently employed Feature Selection (FS) methods for these problems drastically underperform in terms of effectiveness. To address HFSPs, a new Binary variant of the Ali Baba and the Forty Thieves (BAFT) algorithm known as binary adaptive elite opposition-based AFT (BAEOAFT), incorporating historical information and dimensional mutation is presented. The entire population is dynamically separated into two subpopulations in order to maintain population variety, and information and knowledge about individuals are extracted to offer adaptive and dynamic strategies in both subpopulations. Based on the individuals history knowledge, Adaptive Tracking Distance (ATD) and Adaptive Perceptive Possibility (APP) schemes are presented for the exploration and exploitation subpopulations. A dynamic dimension mutation technique is used in the exploration subpopulation to enhance BAEOAFT s capacity in solving HFSPs. Meanwhile, the exploratory subpopulation uses Dlite Dynamic opposite Learning (EDL) to promote individual variety. Even if the exploitation group prematurely converges, the exploration subpopulation s variety can still be preserved. The proposed BAEOAFT-based FS technique was assessed by utilizing the k-nearest neighbor classifier on 20 HFSPs obtained from the UCI repository. The developed BAEOAFT achieved classification accuracy rates greater than those of its competitors and the conventional BAFT in more than 90% of the applied datasets. Additionally, BAEOAFT outperformed its rivals in terms of reduction rates while selecting the fewest number of features.