摘要
给出一个差别矩阵的属性约简定义,证明该属性约简的定义与广义决策属性约简的定义是等价的,对差别矩阵进行了有效的压缩。在此基础上,为求出不完备决策表的属性约简,设计了一个基于该差别矩阵的不完备决策表属性约简算法,其时间复杂度为O(|C|2|U|2),最后用实例说明了该算法的有效性。
The definition of attribution reduction of discernibility matrix is provided.It is proved that the above definition of attribution reduction is the same as the definition of generalized attribution reduction,the discernibility matrix is compressed.On this condition,in order to compute the attribution reduction of incomplete decision table,a new efficient attribution reduc-tion algorithm based on discernibility matrix is designed,the time complexity of the new algorithm is O（｜C｜2｜U｜2）.An example is used to illustrate the efficiency of the new algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第24期103-105,110,共4页
Computer Engineering and Applications
基金
国家自然科学基金(No.60963008)
广西研究生教育科研创新基金(No.200910602M61)
广西教育厅科研基金(No.200807MS015)~~
关键词
粗糙集
不完备决策表
差别矩阵
属性约简
算法复杂度
rough set
incomplete decision table
discernibility matrix
attribution reduction
algorithm complexity
