基于相对知识粒度的决策表约简  

Reduction for decision table based on relative knowledge granularity

作　　者：陈玉明[1] 吴克寿[1] 谢荣生[1] 

机构地区：[1]厦门理工学院计算机科学与技术系,福建厦门361024

出　　处：《山东大学学报（工学版）》2012年第6期8-12,共5页Journal of Shandong University（Engineering Science）

基　　金：国家自然科学基金资助项目(61103246;60903203;61075056);厦门理工学院引进人才项目(YKJ10036R)

摘　　要：知识粒度主要应用于信息系统的属性约简。为了把知识粒度拓展到决策表约简领域,在研究知识粒度的基础上,定义了相对知识粒度的概念,证明了对一致决策表约简而言,相对知识粒度表示与Pawlak代数表示的等价性。进一步定义了基于相对知识粒度的属性重要度,提出了两个基于相对知识粒度的启发式决策表约简算法。通过理论分析与实例表明约简算法是有效可行的。The knowledge granularity was mainly used for attribute reduction in information systems. In order to expand the knowledge granularity to the field of decision table, the relative knowledge granularity was defined based on knowl- edge granularity. The equivalence between the Pawlak algebraic representation and relative granularity representation was proved for a consistent decision table. Based on the definition of relative knowledge granularity, the attribute signif- icance was defined, and two heuristic reduction algorithms for decision table were proposed. Theoretical analysis and the actual example study showed that the reduction algorithms were efficient and feasible.

关 键 词：粗糙集 知识粒度 信息系统 约简 决策表 

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