Parallel batch k-means for Big data clustering

•This paper proposes a new parallel batch clustering algorithm based on k-means.•The algorithm increases the clustering speed.•Real large datasets are used to evaluate the proposed approach.•The analysis shows the practical applicability of the algorithm to Big Data. The application of clustering al...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering Jg. 152; S. 107023
Hauptverfasser: Alguliyev, Rasim M., Aliguliyev, Ramiz M., Sukhostat, Lyudmila V.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.02.2021
Schlagworte:
Batch
Big data
Clustering
K-means
Parallel batch clustering
K-means
Big data
Clustering
Batch
Parallel batch clustering
ISSN:0360-8352, 1879-0550
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•This paper proposes a new parallel batch clustering algorithm based on k-means.•The algorithm increases the clustering speed.•Real large datasets are used to evaluate the proposed approach.•The analysis shows the practical applicability of the algorithm to Big Data. The application of clustering algorithms is expanding due to the rapid growth of data volumes. Nevertheless, existing algorithms are not always effective because of high computational complexity. A new parallel batch clustering algorithm based on the k-means algorithm is proposed. The proposed algorithm splits a dataset into equal partitions and reduces the exponential growth of computations. The goal is to preserve the characteristics of the dataset while increasing the clustering speed. The centers of the clusters are calculated for each partition, which are merged and also clustered later. The approach to determine the optimal batch size is also considered. The statistical significance of the proposed approach is provided. Six experimental datasets are used to evaluate the effectiveness of the proposed parallel batch clustering. The obtained results are compared with the k-means algorithm. The analysis shows the practical applicability of the proposed algorithm to Big Data.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2020.107023