By Topic

An efficient clustering approach using ant colony algorithm in mutidimensional search space

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

4 Author(s)
Lei Jiang ; State Key Lab. of Software Eng., Wuhan Univ., Wuhan, China ; Lixin Ding ; Yang Peng ; Chenhong Zhao

Clustering is an important data analysis technique and it widely used in many field such as data mining, machine learning and pattern recognition. Ant colony optimization clustering is one of the popular partition algorithm. However, in mutidimensional search space, its results is usually ordinary as the disturbing of redundant information. To address the problem, this paper presents MD-ACO clustering algorithm which improves the ant structure to implement attribute reduction. Four real data sets from UCI machine learning repository are used to evaluate MD-ACO with ACO. The results show that MD-ACO is more competitive.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2011 Eighth International Conference on  (Volume:2 )

Date of Conference:

26-28 July 2011