Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Open access · Published 19 June 2018

An Elite Pool-Based Big Bang-Big Crunch Metaheuristic for Data Clustering

Ibrahim Al-Marashdeh1, Ghaith M. Jaradat2, Masri Ayob3, Ahmad Abu-Al-Aish2 & Mutasem Alsmadi1

Journal of Computer Science, Volume 14, Issue 12, pp. 1611–1626 · doi.org/10.3844/jcssp.2018.1611.1626

7,879 accesses4,103 downloads19 citations (Crossref)Metrics
Cite Check for updates

Abstract

This paper delves into the capacity of enhanced Big Bang-Big Crunch (EBB-BC) metaheuristic to handle data clustering problems. BB-BC is a product of an evolution theory of the universe in physics and astronomy. Two main phases of BB-BC are big bang and big crunch. The big bang phase involves a creation of a population of random initial solutions, while in the big crunch phase these solutions are shrunk into one elite solution exhibited by a mass center. This study looks into enhancing the BB-BC’s effectiveness in clustering data. Where, the inclusion of an elite pool alongside implicit solution recombination and local search method, contribute to such enhancement. Such strategies resulted in a balanced search of good quality population that is also diverse. The proposed elite pool-based BB-BC was compared with the original BB-BC and other identical metaheuristics. Fourteen different clustering datasets were used to test BB-BC and the elite pool-based BB-BC showed better performance compared to the original BB-BC. BB-BC was impacted more by the incorporated strategies. The experiments outcomes demonstrate the high quality solutions generated by elite pool-based BB-BC. Its performance in fact supersedes that of identical metaheuristics such as swarm intelligence and evolutionary algorithms.

Licence and reuse

Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Al-Marashdeh, I., Jaradat, G. M., Ayob, M., Abu-Al-Aish, A. & Alsmadi, M. (2018). An Elite Pool-Based Big Bang-Big Crunch Metaheuristic for Data Clustering. Journal of Computer Science, 14(12), 1611–1626. https://doi.org/10.3844/jcssp.2018.1611.1626

Licence
CC BY 3.0
Issue
Volume 14, Issue 12
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
An Elite Pool-Based Big Bang-Big Crunch Metaheuristic for Data ClusteringJournal of Computer Science · Volume 14, Issue 12 · pp. 1611–1626 · CC BY 3.0Download