By Topic

Attribute Reduction of Rough Set Based on Particle Swarm Optimization with Immunity

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
$33 $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)
Weihua Lin ; Huazhong Univ. of Sci. & Technol., Wuhan ; Yonggang Wu ; Dianhui Mao ; Yan Yu

Since the amount of spatial data grows rapidly during recent years, high dimensionality of the domain attributes presents a further obstacle for a number of rule-induction algorithms that would have the potential for automating knowledge acquisition. This paper attempts to tackle the problem by attribute reduction. Firstly, the problem of attribute reduction can be converted into a 0-1 combinatorial optimization problem after the theory of rough set are introduced. Secondly, a binary particle swam optimization algorithm with immunity (BPSOI) is proposed to deal with the problem. Thirdly, an experiment of attribute reduction by constructing data is presented, which indicates that the new algorithm is a very effective method to solve the problem of attribute reduction. Therefore, the new algorithm can improve the efficiency of attribute reduction by a long way, which is employed to remove the redundant and information-poor attributes in the field of knowledge discovered or data mining.

Published in:

Genetic and Evolutionary Computing, 2008. WGEC '08. Second International Conference on

Date of Conference:

25-26 Sept. 2008