2013
DOI: 10.1016/j.chemolab.2012.11.006
|View full text |Cite
|
Sign up to set email alerts
|

Revised DBSCAN algorithm to cluster data with dense adjacent clusters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
90
0
7

Year Published

2014
2014
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 254 publications
(127 citation statements)
references
References 11 publications
0
90
0
7
Order By: Relevance
“…The Ester Martin algorithm [16] was applied to the Jungnangcheon stream data using MATLAB R16a (MathWorks, Natick, MA, USA). Our work performance fulfilled the Water 2017, 9, 220 7 of 15 conditions of CLARANS [29] and revised DBSCAN [17,30,31]. Moreover, cluster points were joined together through maximum density reachability (MDR).…”
Section: Introductionmentioning
confidence: 98%
“…The Ester Martin algorithm [16] was applied to the Jungnangcheon stream data using MATLAB R16a (MathWorks, Natick, MA, USA). Our work performance fulfilled the Water 2017, 9, 220 7 of 15 conditions of CLARANS [29] and revised DBSCAN [17,30,31]. Moreover, cluster points were joined together through maximum density reachability (MDR).…”
Section: Introductionmentioning
confidence: 98%
“…For a point p, the ε-neighborhood of p is the set of all the points around p within distance ε. If the number of points in the ε-neighborhood of p is no smaller than MinPts, then all the points in this set, together with p, belong to the same cluster [20]. The output of this process is the clustering map that categories the historical cases into internal and outer cases as shown in Fig.…”
Section: 2mentioning
confidence: 99%
“…DBSCAN requires two input parameters, Eps (the radius of the cluster) and MinPts (the minimum data objects required inside the cluster). In spite of its advantages, the original DBSCAN algorithm suffers by some drawbacks: (1) it is not easy to determine proper values for Eps and MinPts, (2) the computational complexity without special structure is O(n 2 ), but if a spatial index is used, the complexity can be reduced to O(nlogn) [10], and (3) it fails when the border objects of two clusters are relatively close [11], or when there are multi-density and connected clusters. There have been many efforts to mitigate the drawbacks of DB-SCAN clustering algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Edla and Jana [16] resolve the quadratic computational complexity drawback of DBSCAN by using the prototypes produced from a squared error clustering method such as K-means. Tran et al [11] present a modified version of the DBSCAN algorithm to solve instability of DB-SCAN when detecting border objects of adjacent clusters. There are also some research to solve difficulties in finding appropriate input parameters.…”
Section: Introductionmentioning
confidence: 99%