基于闭算子的属性约简  

Attribute Reduction Based on Closure Operators

作　　者：刘静[1] 米据生[1] 

机构地区：[1]河北师范大学数学与信息科学学院,石家庄050016

出　　处：《计算机科学》2014年第10期249-251,265,共4页Computer Science

基　　金：国家自然科学基金(61170107);高等学校博士学科点专项科研基金(20101303110004)资助

摘　　要：对于协调的信息系统,定义了其条件属性集的幂集上的两个闭算子C(R)与C(r),讨论了相应闭集族的性质,并证明了它们与不可辨识属性集族之间的关系。提出属性约简的一种新方法,给出Cr=CR的充要条件,并证明所定义的属性约简与文献[4,7]中约简的等价性。For a consistent information system,the definitions of two closure operators C（R）and C（r） on the power set of conditional attribute set were first defined respectively,and then the properties of two closed set families Cr and CR were also discussed. The relationships among Cr, CR and the set of all discernibility attribute sets Ω were examined, from which we provided a simple method to attribute reduction in consistent decision table defined in reference [4]. Meanwhile, the sufficient and necessary condition of Cr = CR was proved. Finally, we proved that under condition Cr = CR, the proposed method is equivalent to those in references [4] and [7].

关 键 词：属性约简 闭算子 粗糙集 等价关系 信息系统 

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