会议专题

Rough Set Attributes Reduction Based on Adaptive PBIL Algorithm

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.

Lihua Wang Liangli Ma Qiang Bian Xiliang Zhao

Department of Computer Engineering Naval University of Engineering, Wuhan, China College of Electrical and Information Engineering Naval University of Engineering Wuhan, China

国际会议

2010 IEEE International Conference on Information Theory and Information Security(2010 IEEE 国际信息论与信息安全会议)

北京

英文

21-24

2010-12-17(万方平台首次上网日期,不代表论文的发表时间)