Abstract
The effectiveness and efficiency are two problems in clustering algorithms. DBSCAN(density based spatial clustering of applications with noise) is a typical density based clustering(RDBC) algorithm that is very efficient on large databases. A recursive density based clustering algorithm that can adaptively change its parameters intelligently is presented. This clustering algorithm RDBC is based on DBACAN. It can be shown that RDBC require the same time complexity as that of the DBSCAN algorithm. In addition, it is proved both analytically and experimentally that this method yields results more superior than that of DBSCAN.
| Original language | English |
|---|---|
| Pages (from-to) | 99-104 |
| Number of pages | 6 |
| Journal | Ruan Jian Xue Bao/Journal of Software |
| Volume | 13 |
| Issue number | 1 |
| Publication status | Published - Jan 2002 |
| Externally published | Yes |
Keywords
- Clustering
- Data mining
- Databases
- Web mining