Adaptive black widow optimisation algorithm for data clustering Online publication date: Thu, 04-Nov-2021
by Anmar Abuhamdah
International Journal of Mathematics in Operational Research (IJMOR), Vol. 20, No. 2, 2021
Abstract: Generally, local search approaches are better than population-based approaches in exploiting the search space and worse for exploration. Recently, the black widow optimisation (BWO) algorithm was proposed for engineering optimisation problems as an algorithm balancing between the exploration and exploitation phases. However, the BWO algorithm employed three essential parameter rates, in which a different experiment is needed for each problem. The adaptive black widow optimisation (ABWO) algorithm is proposed to tune the parameters adaptively and accept worse solutions by relying on a local search, using the solutions' qualities average. Six medical datasets are used as a test domain with two calculations criteria to calculate the minimal distance. In order to evaluate the effectiveness of ABWO, a comparison is made between ABWO, BWO and other methods' performances that have been drawn from the acknowledged literature. Outcomes show ABWO is capable of obtaining better cluster qualities, thus outperforming many other methods.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook