Name
Abstract | ||
|---|---|---|
Density based clustering techniques like DBSCAN are attractive because it can find arbitrary shaped clusters along with noisy outliers. Its time requirement is O(n^2) where n is the size of the dataset, and because of this it is not a suitable one to work with large datasets. A solution proposed in the paper is to apply the leaders clustering method first to derive the prototypes called leaders from the dataset which along with prototypes preserves the density information also, then to use these leaders to derive the density based clusters. The proposed hybrid clustering technique called rough-DBSCAN has a time complexity of O(n) only and is analyzed using rough set theory. Experimental studies are done using both synthetic and real world datasets to compare rough-DBSCAN with DBSCAN. It is shown that for large datasets rough-DBSCAN can find a similar clustering as found by the DBSCAN, but is consistently faster than DBSCAN. Also some properties of the leaders as prototypes are formally established. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.patrec.2009.08.008 | Pattern Recognition Letters |
Keywords | Field | DocType |
dbscan,large datasets,experimental study,proposed hybrid clustering technique,similar clustering,time complexity,time requirement,large data set,arbitrary shaped cluster,density information,large datasets rough-dbscan,clustering method,clustering,real world datasets,leaders,fast hybrid density,rough sets,density based clustering,rough set theory,rough set | OPTICS algorithm,Data mining,Clustering high-dimensional data,Pattern recognition,Outlier,Rough set,SUBCLU,Artificial intelligence,Time complexity,Cluster analysis,Mathematics,DBSCAN | Journal |
Volume | Issue | ISSN |
30 | 16 | Pattern Recognition Letters |
Citations | PageRank | References |
19 | 0.80 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Viswanath | 1 | 148 | 11.77 |
| V. Suresh Babu | 2 | 38 | 4.00 |