2016
DOI: 10.1007/978-981-10-0135-2_68
|View full text |Cite
|
Sign up to set email alerts
|

Domain-Driven Density Based Clustering Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…application of Euclidean distance we can define mutual distances as d i,j = ||x i − x j || 2 . Various versions of this algorithm (Antony and Deshpande 2016;Bai et al 2017) differ in the method of distance computation. The inefficient implementations (Shen et al 2016;Schubert et al 2017) calculate all mutual distances before data clustering but there are more effective procedures that rapidly decrease the time complexity of DBSCAN to O (m logm) as in the case of SLINK.…”
Section: Dbscan Techniquementioning
confidence: 99%
“…application of Euclidean distance we can define mutual distances as d i,j = ||x i − x j || 2 . Various versions of this algorithm (Antony and Deshpande 2016;Bai et al 2017) differ in the method of distance computation. The inefficient implementations (Shen et al 2016;Schubert et al 2017) calculate all mutual distances before data clustering but there are more effective procedures that rapidly decrease the time complexity of DBSCAN to O (m logm) as in the case of SLINK.…”
Section: Dbscan Techniquementioning
confidence: 99%