Hybrid enhanced shuffled bat algorithm for data clustering
by Reshu Chaudhary; Hema Banati
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 17, No. 3/4, 2020

Abstract: Enhanced shuffled bat algorithm (EShBAT) is a recently proposed variant of bat algorithm (BA) which has been successfully applied for numerical optimisation. To leverage the optimisation capabilities of EShBAT for clustering, HESB, a hybrid between EShBAT, K-medoids and K-means is proposed in this paper. EShBAT works by dividing the population of bats into groups called memeplexes, each of which evolve independently according to BA. HESB improves on that by employing K-medoids and K-means to generate a rich starting population for EShBAT. It also refines the memeplex best solutions at the end of every generation by employing K-means algorithm. Both these modifications combined together produce an efficient clustering algorithm. HESB is compared to BA, EShBAT, K-means and K-medoids, over ten real-life datasets. The results demonstrate the superiority of HESB.

Online publication date: Fri, 11-Sep-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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