BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Data mining: concepts and techniques
Data mining: concepts and techniques
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
STING: A Statistical Information Grid Approach to Spatial Data Mining
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
| Hi-index | 0.00 |
Data mining applications have recently required a large amount of high-dimensional data. However, most clustering methods for the data miming applications do not work efficiently for dealing with large, high-dimensional data because of the so-called 'curse of dimensionality' and the limitation of available memory. In this paper, we propose a new cell-based clustering method (CBCM) which is more efficient for large, high-dimensional data than the existing clustering methods. Our CBCM provides an efficient cell creation algorithm using a space-partitioning technique and uses a filtering-based index structure using an approximation technique. In addition, we compare the performance of our CBCM with the CLIQUE method in terms of cluster construction time, precision, and retrieval time.