基于扩展可辨识矩阵的混合决策系统属性约简  

Attribute Reduction of Hybrid Decision System Based on Expanded Discernibility Matrix

作　　者：赵焱[1] 杨静[2] 刘海峰[1] 石瀚洋 

机构地区：[1]太原理工大学信息工程学院,太原030024 [2]太原理工大学信息化管理与建设中心,太原030024

出　　处：《科学技术与工程》2014年第1期227-230,共4页Science Technology and Engineering

摘　　要：经典粗糙集理论的研究对象只能是完备的离散决策系统。为了直接对不完备混合决策系统进行属性约简,因此通过引入邻域关系和限制容差关系的概念对可辨识矩阵的定义进行了扩展,提出了一种基于扩展可辨识矩阵的属性约简算法;该算法可以兼容处理完备与不完备混合决策系统。通过UCI数据集的仿真实验证明了该算法的有效性,最后讨论了扩展可辨识矩阵中的邻域阈值选择对属性约简结果的影响。Classical Rough Set Theory,introduced by Professor Pawlak in 1982,its research object could only be the complete discrete decision system. In order to reduct the attribute of the incomplete hybrid deci- sion system directly, expanded the discernibility matrix through the introduction of the concept of neigh- bourhood relation and limited tolerance relation, a attribute reduction algorithm based on expanded discern- ibility matrix is proposed. The attribute reduction can either deal with incomplete or complete hybrid deci- sion system. Demonstrated the effectiveness of the algorithm by simulating experiments of UCI data sets, concluded with a discussion on the influence of selection for neighbouring threshold of expanded discern- ibility matrix on attribute reduction results.

关 键 词：完备与不完备混合决策系统 邻域 限制容差关系 扩展可辨识矩阵 属性约简 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]