Research on an Efficient Rough Set based Attribute Reduction Algorithm

摘要：

Rough set is a valid mathematical theory developed in recent years, which has the ability to deal with imprecise and uncertain information. It has been proven that computing all the reductions and the minimal reduction of information system is a NP-hard problem. In this paper, a coding and sorting method is proposed to reduce the computational complexity of indiscernibility relation and positive region computation, and so attribute reduction can be obtained efficiently. Experimental results showed that the proposed algorithm computed attribute reduction efficiently.

作者: Jun Wang Xiu-Feng Zhong Xi-Yuan Peng

作者单位: Department of Electronics Engineering,Shantou University,No.243 Daxue Road,Shantou,Guangdong,515063, Auto-testing and Control Laboratory,Harbin Institute of Technology,Harbin,Heilongjiang,P.R.China.

会议类型: 国际会议

会议名称: The 3rd International Symposium on Systems and Control in Aeronautics and Astronautics(第三届航空航天系统与控制国际会议 ISSCAA 2010)

会议地点: 哈尔滨

会议语种:英文

页码: 691-694

在线出版日期: 2010-01-08（万方平台首次上网日期，不代表论文的发表时间）