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
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
A Fast Algorithm for Density-Based Clustering in Large Database
PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
A Similarity-Based Robust Clustering Method
IEEE Transactions on Pattern Analysis and Machine Intelligence
Grid-Clustering: An Efficient Hierarchical Clustering Method for Very Large Data Sets
ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2
| Hi-index | 0.00 |
In the paper, a new kind of clustering algorithm called GCARD is proposed. Besides the merits of Density-Based clustering analysis and its efficiency, GCARD can capture the shape and extent of clusters by core grid units, and then analyze data based on the references of core grid units. We present a method of RGUBR to improve the accuracy of grid clustering method, so it can be used to discover information in very large databases.