Publications

Export 7 results:
Sort by: [ Author  (Asc)] Title Type Year
[A] B C D E F G H I J K L M N O P Q R S T U V W X Y Z   [Show ALL]
A
Agrawal, P., T. Ganesh, and A. W. Mohamed, "Solution of Uncertain Solid Transportation Problem by Integer Gaining Sharing Knowledge Based Optimization Algorithm", 2020 International Conference on Computational Performance Evaluation (ComPE), pp. 158 - 162, 2-4 July 2020, Submitted. Abstract
n/a
Agrawal, P., T. Ganesh, and A. W. Mohamed, Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm, , 2021. AbstractWebsite

This article proposes a novel binary version of recently developed Gaining Sharing knowledge-based optimization algorithm (GSK) to solve binary optimization problems. GSK algorithm is based on the concept of how humans acquire and share knowledge during their life span. A binary version of GSK named novel binary Gaining Sharing knowledge-based optimization algorithm (NBGSK) depends on mainly two binary stages: binary junior gaining sharing stage and binary senior gaining sharing stage with knowledge factor 1. These two stages enable NBGSK for exploring and exploitation of the search space efficiently and effectively to solve problems in binary space. Moreover, to enhance the performance of NBGSK and prevent the solutions from trapping into local optima, NBGSK with population size reduction (PR-NBGSK) is introduced. It decreases the population size gradually with a linear function. The proposed NBGSK and PR-NBGSK applied to set of knapsack instances with small and large dimensions, which shows that NBGSK and PR-NBGSK are more efficient and effective in terms of convergence, robustness, and accuracy.

Agrawal, P., T. Ganesh, and A. W. Mohamed, Chaotic gaining sharing knowledge-based optimization algorithm: an improved metaheuristic algorithm for feature selection, , vol. 25, issue 14, pp. 9505 - 9528, 2021. AbstractWebsite

The gaining sharing knowledge based optimization algorithm (GSK) is recently developed metaheuristic algorithm, which is based on how humans acquire and share knowledge during their life-time. This paper investigates a modified version of the GSK algorithm to find the best feature subsets. Firstly, it represents a binary variant of GSK algorithm by employing a probability estimation operator (Bi-GSK) on the two main pillars of GSK algorithm. And then, the chaotic maps are used to enhance the performance of the proposed algorithm. Ten different types of chaotic maps are considered to adapt the parameters of the GSK algorithm that make a proper balance between exploration and exploitation and save the algorithm from premature convergence. To check the performance of proposed approaches of GSK algorithm, twenty-one benchmark datasets are taken from the UCI repository for feature selection. The performance is measured by calculating different type of measures, and several metaheuristic algorithms are adopted to compare the obtained results. The results indicate that Chebyshev chaotic map shows the best result among all chaotic maps which improve the performance accuracy and convergence rate of the original algorithm. Moreover, it outperforms the other metaheuristic algorithms in terms of efficiency, fitness value and the minimum number of selected features.

Agrawal, P., T. Ganesh, and A. W. Mohamed, A novel binary gaining–sharing knowledge-based optimization algorithm for feature selection, , vol. 33, issue 11, pp. 5989 - 6008, 2021. AbstractWebsite

To obtain the optimal set of features in feature selection problems is the most challenging and prominent problem in machine learning. Very few human-related metaheuristic algorithms were developed and solved this type of problem. It motivated us to check the performance of recently developed gaining–sharing knowledge-based optimization algorithm (GSK), which is based on the concept of gaining and sharing knowledge of humans throughout their lifespan. It depends on two stages: beginners–intermediate gaining and sharing stage and intermediate–experts gaining and sharing stage. In this study, two approaches are proposed to solve feature selection problems: FS-BGSK: a novel binary version of GSK algorithm that relies on these two stages with knowledge factor 1 and FS-pBGSK: a population reduction technique that is employed on BGSK algorithm to enhance the exploration and exploitation quality of FS-BGSK. The proposed approaches are checked on twenty two feature selection benchmark datasets from UCI repository that contains small, medium and large dimensions datasets. The obtained results are compared with seven state-of-the-art metaheuristic algorithms; binary differential evolution, binary particle swarm optimization algorithm, binary bat algorithm, binary grey wolf optimizer, binary ant lion optimizer, binary dragonfly algorithm and binary salp swarm algorithm. It concludes that FS-pBGSK and FS-BGSK outperform other algorithms in terms of accuracy, convergence and robustness in most of the datasets.

Agrawal, P., T. Ganesh, D. Oliva, and A. W. Mohamed, S-shaped and V-shaped gaining-sharing knowledge-based algorithm for feature selection, , 2021. AbstractWebsite

In machine learning, searching for the optimal feature subset from the original datasets is a very challenging and prominent task. The metaheuristic algorithms are used in finding out the relevant, important features, that enhance the classification accuracy and save the resource time. Most of the algorithms have shown excellent performance in solving feature selection problems. A recently developed metaheuristic algorithm, gaining-sharing knowledge-based optimization algorithm (GSK), is considered for finding out the optimal feature subset. GSK algorithm was proposed over continuous search space; therefore, a total of eight S-shaped and V-shaped transfer functions are employed to solve the problems into binary search space. Additionally, a population reduction scheme is also employed with the transfer functions to enhance the performance of proposed approaches. It explores the search space efficiently and deletes the worst solutions from the search space, due to the updation of population size in every iteration. The proposed approaches are tested over twenty-one benchmark datasets from UCI repository. The obtained results are compared with state-of-the-art metaheuristic algorithms including binary differential evolution algorithm, binary particle swarm optimization, binary bat algorithm, binary grey wolf optimizer, binary ant lion optimizer, binary dragonfly algorithm, binary salp swarm algorithm. Among eight transfer functions, V4 transfer function with population reduction on binary GSK algorithm outperforms other optimizers in terms of accuracy, fitness values and the minimal number of features. To investigate the results statistically, two non-parametric statistical tests are conducted that concludes the superiority of the proposed approach.

Agrawal, P., H. F. Abutarboush, T. Ganesh, and A. W. Mohamed, "Metaheuristic Algorithms on Feature Selection: A Survey of One Decade of Research (2009-2019)", IEEE Access, vol. 9, pp. 26766 - 26791, 2021. Abstract
n/a
Ali Wagdy Mohamed, Hegazy Zaher, M. K., "A Particle Swarm Approach for Solving Stochastic Optimization Problems", applied mathematics & information sciences, vol. 5, no. 3: naturalspublishing, pp. 379S–401S, 2011. Abstract
n/a
Tourism