By Topic

Rough set attributes reduction based on adaptive PBIL 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

4 Author(s)
Lihua Wang ; Dept. of Comput. Eng., Naval Univ. of Eng., Wuhan, China ; Liangli Ma ; Qiang Bian ; Xiliang Zhao

This paper presents a PBIL algorithm based on adaptive theory-giving that the traditional reduction of rough set is not unique and the process lasts for a long time. The learn probability and mutation rate of traditional PBIL algorithm can change adaptively by introducing the Systemic Entropy, then a self-learning and adaptive variability PBIL algorithm (APBIL) is formed. When it is applied to attributes reduction of rough set, it not only maintains the characteristics of global optimization but also reduces the correlation among attributes. Finally, the simplicity and effectiveness of the algorithm are demonstrated by an example.

Published in:

Information Theory and Information Security (ICITIS), 2010 IEEE International Conference on

Date of Conference:

17-19 Dec. 2010