New Feature Selection Paradigm Based on Hyper-heuristic Technique

Faculty Science Year: 2021
Type of Publication: ZU Hosted Pages:
Authors:
Journal: gApplied Mathematical Modelli Elsevier Volume:
Keywords : , Feature Selection Paradigm Based , Hyper-heuristic Technique    
Abstract:
Feature selection (FS) is a crucial step for effective data mining since it has largest effect on improving the performance of classifiers. This is achieved by removing the irrelevant features and using only the relevant features. Many metaheuristic approaches exist in the literature in attempt to address this problem. The performance of these approaches differ based on the settings of a number of factors including the use of chaotic maps, opposition-based learning (OBL) and the percentage of the population that OBL will be applied to, the metaheuristic (MH) algorithm adopted, the classifier utilized, and the threshold value used to convert real solutions to binary ones. However, it is not an easy task to identify the best settings for these different components in order to determine the relevant features for a specific dataset. Moreover, running extensive experiments to fine tune these settings for each and every dataset will consume considerable time. In order to mitigate this important issue, a hyper-heuristic based FS paradigm is proposed. In the proposed model, a two-stage approach is adopted to identify the best combination of these components. In the first stage, referred to as the training stage, the Differential Evolution (DE) algorithm is used as a controller for selecting the best combination of components to be used by the second stage. In the second stage, referred to as the testing stage, the received combination will be evaluated using a testing set. Empirical evaluation of the proposed framework is based on numerous experiments performed on the most popular 18 datasets from the UCI machine learning repository. Experimental results illustrates that the generated generic configuration provides a better performance than eight other metaheuristic algorithms over all performance measures when applied to the UCI dataset. Moreover, The overall paradigm ranks at number one when compared against state-of-the-art algorithms. Finally, the generic configuration provides a very competitive performance for high dimensional datasets.
   
     
 
       

Author Related Publications

  • Mohamed El Sayed Ahmed Muhamed, "A Grunwald–Letnikov based Manta ray foraging optimizer for global optimization and image segmentation", Elsevier, 2020 More
  • Mohamed El Sayed Ahmed Muhamed, "A novel hybrid gradient-based optimizer and grey wolf optimizer feature selection method for human activity recognition using smartphone sensors", MDPI, 2021 More
  • Mohamed El Sayed Ahmed Muhamed, "Efficient schemes for playout latency reduction in P2P-VOD systems", Springer, 2018 More
  • Mohamed El Sayed Ahmed Muhamed, "a novel algorithm for source localization based on nonnegative matrix factroization using \alpha 'beta divergence in chochleagram", WSEAS, 2013 More
  • Mohamed El Sayed Ahmed Muhamed, "Open cluster membership probability based on K-means clustering algorithm", Springer, 2016 More

Department Related Publications

  • Rodyna Ahmed Mahmoud, "Pre-Open Sets with Ideal", Scientific Research Platform (SRP), 2013 More
  • Rodyna Ahmed Mahmoud, "ON BCL-ALGEBRA", Council for Innovative Research, 2013 More
  • Yasser AbdelAziz Amer Tolba, "The improved (G’/G) - expansion method for constructing exact traveling wave solutions for a nonlinear PDE of nanobiosciences", USA, 2013 More
  • Alaa Hassan Attia Hassan, "A Unified Representation of Some Starlike and Convex Harmonic Functions with Negative Coefficients", AGH University of Science and Technology Press, Krakow 2013, Poland, 2013 More
  • Alaa Hassan Attia Hassan, "Generalizations of Hadamard Procuct of Certain Meromorphic Multivalent Functions with Positive Coefficients", Istanbul Universitesi, Turkey, 2013 More
Tweet