Please use this identifier to cite or link to this item: http://repository.futminna.edu.ng:8080/jspui/handle/123456789/18897
Title: Enhancing Salp Swarm Algorithm Based on Elite Opposition based Learning and Cauchy Mutation Strategies
Authors: Salami, Mercy Onyioza
Oyefolahan, Ishaq Oyebisi
Aminu, Enesi Femi
Adepoju, Solomon Adelowo
Keywords: Cauchy mutation strategy
elite opposition based learning strategy
EOnCaSSA
salp swarm algorithm
Issue Date: Oct-2022
Publisher: ELSEVIER-SSRN
Series/Report no.: ISSN-1556-5068;
Abstract: The significance of machine learning models for real life scenarios to design prediction model is outstanding. However, the nature of datasets available especially in biomedical domain calls for optimization strategies for effective and reliable solution. In view of this development, so many optimization algorithms are promising but not without limitations. For instance, the salp swarm algorithm (SSA), which is a higher level procedure algorithm, has demonstrated a lot of capacity to solve optimization challenges for prediction models. However, to solve an intricate optimization issues, the SSA is deficient with the dawdling convergence pace and a tendency of diminishing into sub-optimal results. Therefore, this research aims to enhance the algorithm using Cauchy mutation and elite opposition based learning strategies. The objective is achieved by fusing these strategies into the existing algorithm; thereby resulting to an enhanced SSA optimization algorithm christened EOnCaSSA in this paper. The search agents of 50, 100, and 150 were chosen for each bench functions and 300, 600 and 900 numbers of iterations were also chosen for each function. It is noteworthy that all the seven benchmark functions for unimodal functions have an optimum value of zero. The four evaluation metrics, which include the best, worst, average and standard deviation to determine and compare the performance of EOnCaSSA presents significant improvement over the tradition SSA. This implies that the enhanced algorithm can be employed to solve both simple and difficult optimization issues as it passes all the benchmark functions tests.
Description: Proceedings of International Conference on Information systems and Emerging Technologies, 2022.
URI: http://repository.futminna.edu.ng:8080/jspui/handle/123456789/18897
ISSN: ELSEVIER-SSRN - ISSN-1556-5068
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
SSA.pdfPROCEDINGS OF ICISET’22 & DSMLAI’22.547.25 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.