Algorithm for Attribute Relative Reduction Based on Generalized Binary Discernibility Matrix
The classical rough set theory,based on complete information system,can not directly deal with incomplete information system.This problem is solved to some extent by developing different kinds of extended rough set models.However,there is still not a unified definition for attributes relative reduction based on the extended rough set models.In this paper,a kind of generalized binary discernibility matrix for several typical extended rough set models was introduced,and a new algorithm for attribute relative reduction based on the generalized binary discernibility matrix was proposed.The feasibility of the proposed methods was demonstrated by the simulation and experiment analysis.
Generalized Binary Discernibility matrix Attribute Reduction Incomplete Information System
Zhang Tengfei Yang Xingxing Fumin Ma
College of Automation,Nanjing University of Posts and Telecommunications,Nanjing,Jiangsu,China 21002 College of Information Engineering,Nanjing University of Finance and Economics,Nanjing,Jiangsu,China
国际会议
长沙
英文
2626-2631
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）