Heuristic Search for Cluster Centroids: An Ant-Based Approach for FCM Initialization
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Ant estimator with application to target tracking
Signal Processing
Integrating clustering and supervised learning for categorical data analysis
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Application of digital ecosystem design methodology within the health domain
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Ant clustering PHD filter for multiple-target tracking
Applied Soft Computing
A novel ant-based clustering algorithm using the kernel method
Information Sciences: an International Journal
Data clustering using harmony search algorithm
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
International Journal of Speech Technology
A powerful hybrid clustering method based on modified stem cells and Fuzzy C-means algorithms
Engineering Applications of Artificial Intelligence
Enhanced interval type-2 fuzzy c-means algorithm with improved initial center
Pattern Recognition Letters
| Hi-index | 0.00 |
A swarm-intelligence-inspired approach to clustering data is described. The algorithm consists of two stages. In the first stage of the algorithm, ants move the cluster centers in feature space. The cluster centers found by the ants are evaluated using a reformulated fuzzy C-means (FCM) criterion. In the second stage, the best cluster centers found are used as the initial cluster centers for the FCM algorithm. Results on 18 data sets show that the partitions found using the ant initialization are better optimized than those obtained from random initializations. The use of a reformulated fuzzy partition validity metric as the optimization criterion is shown to enable determination of the number of cluster centers in the data for several data sets. Hard C-means (HCM) was also used after reformulation, and the partitions obtained from the ant-based algorithm were better optimized than those from randomly initialized HCM.