A survey on density-based clustering algorithms

30Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Density-based clustering forms the clusters of densely gathered objects separated by sparse regions. In this paper, we survey the previous and recent density-based clustering algorithms. DBSCAN [6], OPTICS [1], and DENCLUE [5, 6] are previous representative density-based clustering algorithms. Several recent algorithms such as PDBSCAN [8], CUDA-DClust [3], and GSCAN [7] have been proposed to improve the performance of DBSCAN. They make the most of multi-core CPUs and GPUs. © Springer-Verlag Berlin Heidelberg 2014.

Cite

CITATION STYLE

APA

Loh, W. K., & Park, Y. H. (2014). A survey on density-based clustering algorithms. In Lecture Notes in Electrical Engineering (Vol. 280 LNEE, pp. 775–780). Springer Verlag. https://doi.org/10.1007/978-3-642-41671-2_98

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