Application of ant K-means on clustering analysis

  • Authors:
  • R. J. Kuo;H. S. Wang;Tung-Lai Hu;S. H. Chou

  • Affiliations:
  • -;-;-;-

  • Venue:
  • Computers & Mathematics with Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.11

Visualization

Abstract

This paper intends to propose a novel clustering method, ant K-means (AK) algorithm. AK algorithm modifies the K-means as locating the objects in a cluster with the probability, which is updated by the pheromone, while the rule of updating pheromone is according to total within cluster variance (TWCV). The computational results showed that it is better than the other two methods, self-organizing feature map (SOM) followed by K-means method and SOM followed by genetic K-means algorithm via 243 data sets generated by Monte Carlo simulation. To further testify this novel method, the questionnaire survey data for the plasma television market segmentation is employed. The results also indicated that the proposed method is the best among these three methods based on TWCV.