会议专题

An Attribute Reduction Algorithm Based on Rough Set, Information Entropy and Ant Colony Optimization

For resolving attibute reduction of the NP-hard problems effectively, a new complete and efficient Attribute Reduction Algorithm of Rough Set Based on Information Entropy and Ant Colony Algorithm is proposed. After computiing a core of the database by the algorithm of Rough Set and Information Entropy, find the other attibutes in the least reduction of attributes set by the proposed method. Experiments show that the proposed method can get not only the least reduction of complete and incomplete attributes set efficiently and effectively but also more least reductions. The proposed method is of profoud theoretical and pratical significance.

rough sets information entropy ant colony algorithm attribute reduction

GUAN Xin GUO Qiang ZHAO Jing ZHANG Zheng-chao

The Institute of Electronic Science and Engineering ,National University of Defense Technology,Chang Research Institute of Information Fusion , Naval Aeronautical And Astronautical University ,Yantai S PLA Unit 63880,Luoyang Henan, China

国际会议

2010 IEEE 10th International Conference on Signal Processing(第十届信号处理国际会议 ICSP 2010)

北京

英文

1313-1317

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