Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
STING: A Statistical Information Grid Approach to Spatial Data Mining
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
DGCL: an efficient density and grid based clustering algorithm for large spatial database
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
An approach to find embedded clusters using density based techniques
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Hi-index | 0.00 |
This paper presents a distributed Grid-based Density Clustering using Triangle-subdivision (DGDCT), capable of identifying arbitrary shaped embedded clusters as well as multi density clusters over large spatial datasets. Experimental results are presented to establish the superiority of the technique in terms of scale-up, speedup as well as cluster quality.