不完备系统中基于优势关系的最优可信规则获取  

Mining Optimal Credible Rules in Incomplete Systems Based on Dominance Relation

作　　者：杨习贝[1] 杨静宇[1] 吴小俊[2] 於东军[1] 宋晓宁[1] 

机构地区：[1]南京理工大学计算机科学与技术学院,江苏南京210094 [2]江南大学信息工程学院,江苏无锡214036

出　　处：《小型微型计算机系统》2009年第3期518-523,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60472060,60572034)资助;国家自然科学基金项目(60632050)资助;江苏省自然科学基金项目(BK2006081)资助

摘　　要：以具有遗漏型未知属性值的不完备目标信息系统为研究对象,根据优势关系,提出升序和降序最优可信规则.给出基于优势关系的描述子的概念,由此获得不完备目标信息系统中的升序和降序可信规则.定义了基于区分矩阵的区分函数用以计算对象的升序和降序约简,从而获得升序和降序最优可信规则,为从不完备目标信息系统中获取规则提供了新的理论基础与技术手段.In this paper, the incomplete objective information system in which all unknown values are considered as lost is deeply investigated. In such information systems, the concepts of optimal credible rules in terms of increasing and decreasing preferences are proposed based on the dominance relation. To derive all credible rules from the incomplete objective information system, the concept of descriptions are presented. Furthermore, from the viewpoint of the discernibility functions based on the discernibility matrixes, the increasing and decreasing reducts of objects can he worked out and as a result, the optimal credible rules are obtained. The research is meaningful both in the theory and in applications for the acquisition of rules in the incomplete objective information systems.

关 键 词：不完备目标信息系统 优势关系 最优可信规则 约简 

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