.png){kind=icon}
Return
Parallel batch k-means for Big data clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2020.107023.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Big data
Clustering
Batch
K-means
Parallel batch clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
Automatic Field Detection of Western Corn Rootworm (Diabrotica virgifera virgifera; Coleoptera: Chrysomelidae) with a New Probe.png)
Insects
OAAI
InsectsIF0
OAAIShareSaveA Novel Sampling Model to Study the Epidemiology of Canine Leishmaniasis in an Urban Environment
OAAI
OAAIShareSaveShareSaveShareSave
View more