Ahmed G. Gad

Mr. Ahmed G. Gad

Faculty of Computers and Information, Kafrelsheikh University, Kafr ash Shaykh, Egypt
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 April 2022 in Archives of Computational Methods in Engineering
Verified
Journal Article
Open access
PDF file
Ahmed G. GadAhmed G. Gad
Ahmed G. Gad
Throughout the centuries, nature has been a source of inspiration, with much still to learn from and discover about. Among many others, Swarm Intelligence (SI), a substantial branch of Artificial Intelligence, is built on the intelligent collective behavior of social swarms in nature. One of the most popular SI paradigms, the Particle Swarm Optimization algorithm (PSO), is presented in this work. Many changes have been made to PSO since its inception in the mid 1990s. Since their learning about the technique, researchers and practitioners have developed new applications, derived new versions, and published theoretical studies on the potential influence of various parameters and aspects of the algorithm. Various perspectives are surveyed in this paper on existing and ongoing research, including algorithm methods, diverse application domains, open issues, and future perspectives, based on the Systematic Review (SR) process. More specifically, this paper analyzes the existing research on methods and applications published between 2017 and 2019 in a technical taxonomy of the picked content, including hybridization, improvement, and variants of PSO, as well as real-world applications of the algorithm categorized into: health-care, environmental, industrial, commercial, smart city, and general aspects applications. Some technical characteristics, including accuracy, evaluation environments, and proposed case study are involved to investigate the effectiveness of different PSO methods and applications. Each addressed study has some valuable advantages and unavoidable drawbacks which are discussed and has accordingly yielded some hints presented for addressing the weaknesses of those studies and highlighting the open issues and future research perspectives on the algorithm.

1 June 2021 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
Essam Halim HousseinEssam Halim Houssein
Essam Halim Houssein
Ahmed G. GadAhmed G. Gad
Ahmed G. Gad
KHKashif Hussain
Kashif Hussain
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan

1 April 2021 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
Essam Halim HousseinEssam Halim Houssein
Essam Halim Houssein
Ahmed G. GadAhmed G. Gad
Ahmed G. Gad
YWYaser M. Wazery
Yaser M. Wazery
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan

1 October 2022 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
Ahmed G. GadAhmed G. Gad
Ahmed G. Gad
DMDiana T. Mosa
Diana T. Mosa
LALaith Abualigah
Laith Abualigah
AAAmr A. Abohany
Amr A. Abohany

27 April 2022 in Neural Computing and Applications
Verified
Journal Article
Open access
PDF file
Ahmed G. GadAhmed G. Gad
Ahmed G. Gad
Karam SallamKaram Sallam
Karam Sallam
Ripon K ChakraborttyRipon K Chakrabortty
Ripon K Chakrabortty
MRMichael J. Ryan
Michael J. Ryan
AAAmr A. Abohany
Amr A. Abohany
Feature Selection (FS) is an important preprocessing step that is involved in machine learning and data mining tasks for preparing data (especially high-dimensional data) by eliminating irrelevant and redundant features, thus reducing the potential curse of dimensionality of a given large dataset. Consequently, FS is arguably a combinatorial NP-hard problem in which the computational time increases exponentially with an increase in problem complexity. To tackle such a problem type, meta-heuristic techniques have been opted by an increasing number of scholars. Herein, a novel meta-heuristic algorithm, called Sparrow Search Algorithm (SSA), is presented. The SSA still performs poorly on exploratory behavior and exploration-exploitation trade-off because it does not duly stimulate the search within feasible regions, and the exploitation process suffers noticeable stagnation. Therefore, we improve SSA by adopting: i) a strategy for Random Re-positioning of Roaming Agents (3RA); and ii) a novel Local Search Algorithm (LSA), which are algorithmically incorporated into the original SSA structure. To the FS problem, SSA is improved and cloned as a binary variant, namely, the improved Binary SSA (iBSSA), which would strive to select the optimal or near-optimal features from a given dataset while keeping the classification accuracy maximized. For binary conversion, the iBSSA was primarily validated against nine common S-shaped and V-shaped Transfer Functions (TFs), thus producing nine iBSSA variants. To verify the robustness of these variants, three well-known classification techniques, includingk-Nearest Neighbor (k-NN), Support Vector Machine (SVM), and Random Forest (RF) were adopted as fitness evaluators with the proposed iBSSA approach and many other competing algorithms, on 18 multifaceted, multi-scale benchmark datasets from the University of California Irvine (UCI) data repository. Then, the overall best-performing iBSSA variant for each of the three classifiers was compared with binary variants of 12 different well-known meta-heuristic algorithms, including the original SSA (BSSA), Artificial Bee Colony (BABC), Particle Swarm Optimization (BPSO), Bat Algorithm (BBA), Grey Wolf Optimization (BGWO), Whale Optimization Algorithm (BWOA), Grasshopper Optimization Algorithm (BGOA) SailFish Optimizer (BSFO), Harris Hawks Optimization (BHHO), Bird Swarm Algorithm (BBSA), Atom Search Optimization (BASO), and Henry Gas Solubility Optimization (BHGSO). Based on a Wilcoxon’s non-parametric statistical test ( $$\alpha =0.05$$α=0.05 ), the superiority of iBSSA with the three classifiers was very evident against counterparts across the vast majority of the selected datasets, achieving a feature size reduction of up to 92% along with up to 100% classification accuracy on some of those datasets.

13 January 2022 in IEEE Access
Verified
Journal Article
Open access
HAHanan E. Abdelkader
Hanan E. Abdelkader
Ahmed G. GadAhmed G. Gad
Ahmed G. Gad
AAAmr A. Abohany
Amr A. Abohany
SSShaymaa E. Sorour
Shaymaa E. Sorour
All the educational organizations mainly aim at elevating the academic performance of students for improving the overall quality of education. In this direction, Educational Data Mining (EDM) is a rapidly trending research area that utilizes the essence of Data Mining (DM) concepts to help academic institutions figure out useful information on the Student Satisfaction Level (SSL) with the Online Learning process (OL) during COVID-19 lock-down. Different practices have been tried with EDM to predict students’ behaviors to reach the best educational settings. Therefore, Feature Selection (FS) is typically employed to find the most relevant subset of features with minimum cardinality. As the predictive accuracy of a satisfaction model is significantly influenced by the FS process, the effectiveness of the SSL model is elaborately studied in this paper in connection with FS techniques. In this connection, a dataset was first collected online via a questionnaire of student reviews on OL courses. Using this datatset, the performance of wrapper FS techniques in DM and classification algorithms was analyzed in terms of fitness values. Ultimately, the goodness of subsets with different cardinalities is evaluated in terms of prediction accuracy and number of selected features by measuring the quality of 11 wrapper-based FS algorithms and the $k$ -Nearest Neighbor ( $k$ -NN) and Support Vector Machine (SVM) as base-line classifiers. Based on the experiments, the optimal dimensionality of the feature subset was revealed, as well as the best method. The findings of the present study evidently support the well-known conjunction of the existence of minimum number of features and an increase in predictive accuracy. It is remarkable the relevancy of FS for high-accuracy SSL prediction, as the relevant set of features can effectively assist in deriving constructive educational strategies. Our study contributes a feature size reduction of up to 80% along with up to 100% classification accuracy on the adopted real-time dataset.