Detailed Information

Cited 0 time in webofscience Cited 25 time in scopus
Metadata Downloads

A survey on density-based clustering algorithms

Authors
Loh W.-K.Park Y.-H.
Issue Date
2014
Publisher
Springer Verlag
Citation
Lecture Notes in Electrical Engineering, v.280 LNEE, pp.775 - 780
Journal Title
Lecture Notes in Electrical Engineering
Volume
280 LNEE
Start Page
775
End Page
780
URI
https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/6172
DOI
10.1007/978-3-642-41671-2_98
ISSN
1876-1100
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.
Files in This Item
Go to Link
Appears in
Collections
ICT융합공학부 > IT공학전공 > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Park, Young Ho photo

Park, Young Ho
ICT융합공학부 (IT공학전공)
Read more

Altmetrics

Total Views & Downloads

BROWSE