相容关系下的覆盖粗糙集  

Covering-based Rough Sets Under Compatibility Relation

作　　者：张转转[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,四川成都611731

出　　处：《电脑与信息技术》2012年第5期16-19,共4页Computer and Information Technology

摘　　要：为了更有效地覆盖粗糙集理论应用到数据挖掘领域,所以对相容关系下的覆盖粗糙集进行了一系列的探究。首先介绍了基于相容关系的覆盖的定义以及基于相容关系的覆盖的特例--最大相容类的集合生成的覆盖的一些性质;其次对相容关系下由所有最大相容类的集合生成的覆盖中的可约元进行了讨论,并对这个条件下覆盖是否为单一的覆盖进行了探讨;接着借助于最小描述提出了k-最简覆盖这个概念,并对其做了简单的探究;最后探究了一些评价相容关系下的覆盖粗糙集的数值标准,并且分析了绝对覆盖率和相对覆盖率相等的情况。In order to preferably utilize the covering-based rough set theory in data mining, a serial of explorations about covering-based rough sets under compatibility relation are made. First of all, a definition of covering-based rough sets under compatibility relation is defined and some properties about a specific case which is a set of the maximum compatible class are investigated. Then the reducible element in covering-based rough sets under compatibility relation is considered, and whether the covering is unary or not under such circumstance is explored. A definition of k-simplest rough sets with the help of minimal description is given and then it is delved into briefly. Finally, some evaluating standards of this kind of covering are showed. And how to make absolute covering rate equal to opposite covering rate is analyzed.

关 键 词：粗糙集 相容关系 覆盖 最大相容类 

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