2009
DOI: 10.1007/978-3-540-93905-4_24
|View full text |Cite
|
Sign up to set email alerts
|

Enhanced Density Based Algorithm for Clustering Large Datasets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…El-Sonbaty et al (2004) try to scale DBSCAN by first partitioning the dataset then examining dense regions in each partition and finally merging these dense regions to reach the final natural number of clusters. Further progress is found in El- Sonbaty and Said (2009) in which the concept of leaders (prototypes) is used.…”
Section: Clustering Algorithmsmentioning
confidence: 99%
“…El-Sonbaty et al (2004) try to scale DBSCAN by first partitioning the dataset then examining dense regions in each partition and finally merging these dense regions to reach the final natural number of clusters. Further progress is found in El- Sonbaty and Said (2009) in which the concept of leaders (prototypes) is used.…”
Section: Clustering Algorithmsmentioning
confidence: 99%