arrow
Return

Hierarchical Density-Based Clustering Using MapReduce

delete2021-03-01
delete18
delete
OA
AI
M
Murilo Coelho Naldi *
R
Ricardo J. G. B. Campello
J
Jörg Sander
DOI:10.1109/TBDATA.2019.2907624delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Hierarchical density-based clustering is a powerful tool for exploratory data analysis, which can play an important role in the understanding and organization of datasets. However, its applicability to large datasets is limited because the computational complexity of hierarchical clustering methods has a quadratic lower bound in the number of objects to be clustered. MapReduce is a popular programming model to speed up data mining and machine learning algorithms operating on large, possibly distributed datasets. In the literature, there have been attempts to parallelize algorithms such as Single-Linkage, which in principle can also be extended to the broader scope of hierarchical density-based clustering, but hierarchical clustering algorithms are inherently difficult to parallelize with MapReduce. In this paper, we discuss why adapting previous approaches to parallelize Single-Linkage clustering using MapReduce leads to very inefficient solutions when one wants to compute density-based clustering hierarchies. Preliminarily, we discuss one such solution, which is based on an exact, yet very computationally demanding, random blocks parallelization scheme. To be able to efficiently apply hierarchical density-based clustering to large datasets using MapReduce, we then propose a different parallelization scheme that computes an approximate clustering hierarchy based on a much faster, recursive sampling approach. This approach is based on HDBSCAN*, the state-of-the-art hierarchical density-based clustering algorithm, combined with a data summarization technique called data bubbles. The proposed method is evaluated in terms of both runtime and quality of the approximation on a number of datasets, showing its effectiveness and scalability.
Keywords:
Clustering algorithms
Partitioning algorithms
Programming
Data models
Machine learning algorithms
Big Data
Computational modeling
Density-based hierarchical clustering
MapReduce
big data
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

I
IEEE Transactions on Big Data
IF:
5.7
Papers:
834
Citations:
3.0K

Organization

U
university of alberta
Scholars:
5.1W
Papers: 4.9W
Citations: 65
U
universidade federal de sao carlos
Scholars:
9.9K
Papers: 8.4K
Citations: 8
U
University of Newcastle
Scholars:
1.5W
Papers: 1.5W
Citations: 16
U
universidade de sao paulo
Scholars:
10.5W
Papers: 6.7W
Citations: 93
researcher View more organizations