基于改进关系积的最小属性约简算法  

Minimum Attribute Reduction Algorithm Based on Improved Attribute Union

作　　者：叶明全[1] 伍长荣[2] 

机构地区：[1]皖南医学院计算机教研室,芜湖241002 [2]安徽师范大学数学计算机学院,芜湖241002

出　　处：《计算机工程》2010年第12期78-79,共2页Computer Engineering

基　　金：安徽省教育厅自然科学基金资助项目(KJ2008B039)

摘　　要：属性约简是粗糙集理论的核心内容之一。针对现有关系积理论不能求解不一致决策表中最小属性约简的缺陷,提出一种基于知识联合划分的改进关系积和关系积约简概念,分析了关系积约简、正区域和负区域之间的性质,提出一种基于改进关系积的最小属性约筒算法。理论分析和实例计算结果表明,该算法具有可行性,能求取一致或不一致决策表中所有最小属性约简。Attribute reduction is a kernel part of rough set theory. The existing attribute union definition and the relative attribute reduction algorithm can not obtain the minimum reduction over inconsistent decision table. Aiming at this problem, the improved attribute union and the attribute union reduction based on combination knowledge partition are defined, and their several useful properties are derived. Some relationships among attribute union reduction, positive region and negative region are studied. Theoretical analysis and example show that the minimum attribute reduction algorithm based on the improved attribute union is practicable and can get all the minimum attribute reduction for the consistent or inconsistent decision table.

关 键 词：粗糙集 不一致决策表 关系积 最小属性约简 

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