Abstract

There is a growing interest in the study development of artificial intelligence and machine learning, especially regarding the support vector machine pattern classification method. This study proposes an enhanced implementation of the well-known whale optimisation algorithm, which combines chaotic and opposition-based learning strategies, which is adopted for hyper-parameter optimisation and feature selection machine learning challenges. The whale optimisation algorithm is a relatively recent addition to the group of swarm intelligence algorithms commonly used for optimisation. The Proposed improved whale optimisation algorithm was first tested for standard unconstrained CEC2017 benchmark suite and it was later adapted for simultaneous feature selection and support vector machine hyper-parameter tuning and validated for medical diagnostics by using breast cancer, diabetes, and erythemato-squamous dataset. The performance of the proposed model is compared with multiple competitive support vector machine models boosted with other metaheuristics, including another improved whale optimisation approach, particle swarm optimisation algorithm, bacterial foraging optimisation algorithms, and genetic algorithms. Results of the simulation show that the proposed model outperforms other competitors concerning the performance of classification and the selected subset feature size.

Highlights

  • Constructing algorithms to solve non-deterministic polynomial time hard problems (NP-hard) is not typically hard to do

  • The results indicate that the support vector machine (SVM) structure generated by the COWOAFS-SVM algorithm outperforms all other SVM approaches, in terms of accuracy, area under curve, sensitivity and specificity

  • COWOAFS-SVM achieved average accuracy of 96.84%, together with the standard deviation that is smaller than the results of the MWOA-SVM and other compared methods, indicating that the COWOAFS-SVM is capable of producing consistent results

Read more

Summary

Introduction

Constructing algorithms to solve non-deterministic polynomial time hard problems (NP-hard) is not typically hard to do. Executing such an algorithm can, in extreme cases, take thousands of years on contemporary hardware. Such problems are regarded as nearly impossible to solve with traditional approaches for finding a deterministic algorithm. Metaheuristics, as stochastic optimisation approaches, are useful for solving such problems These approaches do not guarantee an optimum solution. Swarm intelligence is based on natural biological systems, and function with a population of selforganising agents who interact with one another locally and globally with their environment. Agents are affected by the environment and changes made to it, which can be a result of other agents’ actions, or from external influences

Methods
Results
Discussion
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.