.png){kind=icon}
Return
A parallel algorithm for approximating the silhouette using a ball tree
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2022.11.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Clustering is widely used in many scientific fields. The contribution of enumerating the value of the silhouette is twofold: firstly it can help choosing a suitable cluster count and secondly it can be used to evaluate the quality of a clustering. Enumerating the silhouette exactly is an extremely time-consuming task, especially in big data applications; it is therefore common to approximate its value. This article presents an efficient shared-memory parallel algorithm for approximating the silhouette, which uses a ball tree. The process of initialising the ball tree and enumerating the silhouette are fully parallelised using the OpenMP API. The results of our experiments show that the proposed parallel algorithm substantially increases the speed of computing the silhouette whilst retaining necessary precision for real-world applications.(c) 2022 Elsevier Inc. All rights reserved.
Keywords:
Ball tree
Data mining
High-performance computing
k-means clustering
Silhouette
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
Cited Papers
A Hybrid MPI/OpenMP Parallelization of K-Means Algorithms Accelerated Using the Triangle Inequality.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSaveSecurity Performance Analysis of Relay Networks Based on
κ
-
μ
Shadowed Channels with RHIs and CEEs
OAAI
OAAIShareSaveAccelerated K-Means Algorithms for Low-Dimensional Data on Parallel Shared-Memory SystemsIEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAIShareSave
View more