Big data clustering based on spark chaotic improved particle swarm optimization

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In recent years, the surge in continuously accelerating data generation has given rise to the prominence of big data technology. The MapReduce architecture, situated at the core of this technology, provides a robust parallel environment. Spark, a leading framework in the big data landscape, extends the capabilities of the traditional MapReduce model. Coping with big data, especially in the realm of clustering, requires more efficient techniques. Meta-heuristic-based clustering, known for offering global solutions within reasonable time frames, emerges as a promising approach. This paper introduces a parallel-distributed clustering algorithm for big data within the Spark Framework, named Spark, chaotic improved PSO (S-CIPSO). Centered on particle swarm optimization (PSO), the proposed algorithm is enhanced with a chaotic map and an efficient procedure. Test results, conducted on both real and artificial datasets, establish the superior performance and quality of clustering results achieved by the proposed approach. Additionally, the scalability and robustness of S-CIPSO are validated, demonstrating its effectiveness in handling large-scale datasets.

Cite

CITATION STYLE

APA

Boushaki, S. I., Mahammed, B. H., Bendjeghaba, O., & Mosbah, M. (2024). Big data clustering based on spark chaotic improved particle swarm optimization. Indonesian Journal of Electrical Engineering and Computer Science, 34(1), 419–429. https://doi.org/10.11591/ijeecs.v34.i1.pp419-429

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free