| 不完备决策表的差别矩阵属性约简算法 |
| |
| 引用本文： | 舒文豪,徐章艳,钱文彬,杨炳儒.不完备决策表的差别矩阵属性约简算法[J].计算机工程与应用,2011,47(24):103-105. |
| |
| 作者姓名： | 舒文豪 徐章艳 钱文彬 杨炳儒 |
| |
| 作者单位： | 1.广西师范大学 计算机科学与信息工程学院，广西 桂林 541004 2.北京科技大学 信息工程学院，北京 100083 |
| |
| 基金项目： | 国家自然科学基金，广西研究生教育科研创新基金，广西教育厅科研基金 |
| |
| 摘 要： | 给出一个差别矩阵的属性约简定义，证明该属性约简的定义与广义决策属性约简的定义是等价的，对差别矩阵进行了有效的压缩。在此基础上，为求出不完备决策表的属性约简，设计了一个基于该差别矩阵的不完备决策表属性约简算法，其时间复杂度为O(|C|2|U|2)，最后用实例说明了该算法的有效性。
|
| 关 键 词： | 粗糙集 不完备决策表 差别矩阵 属性约简 算法复杂度 |
| 修稿时间： | |
Attribution reduction algorithm based on discernibility matrix of incomplete decision table |
| |
| SHU Wenhao,XU Zhangyan,QIAN Wenbin,YANG Bingru.Attribution reduction algorithm based on discernibility matrix of incomplete decision table[J].Computer Engineering and Applications,2011,47(24):103-105. |
| |
| Authors: | SHU Wenhao XU Zhangyan QIAN Wenbin YANG Bingru |
| |
| Affiliation: | 1.School of Computer Science and Information Engineering，Guangxi Normal University，Guilin，Guangxi 541004，China 2.School of Information Engineering，University of Science and Technology Beijing，Beijing 100083，China |
| |
| Abstract: | 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. |
| |
| Keywords: | rough set incomplete decision table discernibility matrix attribution reduction algorithm complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
