By Topic

Context quantization based on the ant K-means clustering algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wei Wang ; Dept. of Electron. Eng., Yunnan Univ., Kunming, China ; Shuyan Peng ; Jianhua Chen

In this paper, we present an improved context quantization algorithm based on a hybrid K-means and ant colony clustering algorithm. The K-means clustering algorithm is used to construct the initial solution for a context quantization problem. An ant colony based clustering algorithm is then used to improve the quality of the solution. During each iteration, objects are assigned to respective clusters based on the corresponding pheromone concentrations updated by the artificial ants. Then, a local search procedure is conducted by a small part of the ants with the best objective function values to further refine the solution. Experiment results show that the presented algorithm outperforms the K-means clustering based context quantization algorithm and the Maximum Mutual Information based context quantization algorithm under various quantization levels.

Published in:

Systems and Informatics (ICSAI), 2012 International Conference on

Date of Conference:

19-20 May 2012