Random sampling with a reservoir
ACM Transactions on Mathematical Software (TOMS)
BIRCH: an efficient data clustering method for very large databases
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
In search of optimal clusters using genetic algorithms
Pattern Recognition Letters
CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
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
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Synchronization Based Algorithm for Discovering Ellipsoidal Clusters in Large Datasets
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
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
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
ROCK: A Robust Clustering Algorithm for Categorical Attributes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper is devoted to a novel stochastic generalized cellular automata (GCA) for self-organizing data clustering in enterprise computing. The GCA transforms the data clustering process into a stochastic process over the configuration space on a GCA array. The GCA-based approach to data clustering has many advantages in terms of the real-time performance and the ability to effectively deal with a variety of data sets, including noise data, dynamical data, multi-type and multi-distribution data, high-dimensional and large-scale data set. The GCA clustering approach also has the learning ability, and the better feasibility for hardware implementation with VLSI systolic technology. The simulations and comparisons have shown the effectiveness of the proposed GCA for the data clustering in enterprise computing.