Cluster analysis and related issues
Handbook of pattern recognition & computer vision
ACM Computing Surveys (CSUR)
Pattern Recognition and Neural Networks
Pattern Recognition and Neural Networks
An Empirical Study on GAs "Without Parameters"
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
A kurtosis-based dynamic approach to Gaussian mixture modeling
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Survey of clustering algorithms
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. Traditional clustering algorithms usually predefine the number of clusters via random selection or contend based knowledge. An improper pre-selection for the number of clusters may easily lead to bad clustering outcome. In order to address this issue we propose in this paper a new evolutionary clustering algorithm based on Gaussian Mixture Model. Specifically, the algorithm defines a new entropy-based fitness function, and two new evolutionary operators for splitting and merging clusters. During the evaluation, we conducted two sets of experiments using a synthetic dataset and an existing benchmark for validating our algorithm. The results obtained in the first experiment show that the algorithm can estimate exactly the optimal number of clusters for a set of data. In the second experiment, we computed three major clustering validity indices and compared the corresponding results with those obtained using established clustering techniques, and found that our evolutionary clustering algorithm achieves better clustering structure.