不一致决策表的分配序约简  

Ordered Assignment Reduction in Inconsistent Decision Tables

作　　者：黄兵[1] 周献中[2] 

机构地区：[1]南京审计学院计算机科学与技术系,江苏南京210029 [2]南京大学工程管理学院,江苏南京210093

出　　处：《南京理工大学学报》2005年第3期360-362,367,共4页Journal of Nanjing University of Science and Technology

基　　金：江苏省自然科学基金(BK2004137)

摘　　要：在不一致决策表中定义了分配序约简,给出分配序一致集的判定定理。通过定义分配序区分矩阵给出求分配序约简的区分矩阵法。为克服区分矩阵法时间复杂度随系统大小的增加而指数增长的缺陷,通过定义属性的相对重要性,提出一种求分配序约简的启发式算法。通过实例分析说明启发式算法的有效性,为从不一致决策表中获取知识提供了一种有效方法。Ordered assignment reduction is defined in inconstant decision tables. The judgment theorem and discernibility matrix with respect to consistent ordered assignment set is obtained. To overcome the disadvantage of ordered assignment reduction based on the discernibility matrix as the time complexity is exponential along with the size of inconstant decision table, a heuristic algorithm based on the significance of condition attributes is proposed. Example analysis proves the validity of the heuristic algorithm. This work supplies a new method to acquire knowledge from inconsistent decision tables.

关 键 词：粗糙集 不一致决策表 分配序约简 

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