粗糙集的粗糙度  

The Roughness Measures of the Rough Sets

作　　者：刘贵龙[1] 

机构地区：[1]北京语言大学信息科学学院 北京 100083

出　　处：《计算机科学》2004年第3期140-141,153,共3页Computer Science

基　　金：教育部科学技术重点项目(01043)资助

摘　　要：设U是全集,R是U上的等价关系,(U,R)是相应的近似空间,则粗相等关系≈是幂集P(U)上的等价关系,其商集为P(U)/≈,而商集P(U)/≈是一个分配格,本文考虑两种特殊情况,使得在这两种特殊情况下粗糙度有类似于集合论的包容排斥原理,同时我们还把此结论推广到粗糙模糊集上。Let U denote a finite and nonempty set called the universe, and P(U) a power set of U. Suppose that R is an equivalence relation on U. We proved that if X or Y is the definable set, then between the roughness measures of sets X,Y, X∩Y and X∪Y have a similar inclusion-exclusion principle for rough, sets. Consider the roughly equal relation which is an equivalence relation on P(U),the equivalence relation partitions the P(U) into disjoint subsets. The quotient set is denoted by F(U)/≈ We obtain a similar inclusion-exclusion principle on P(U)/≈.. We also extend these results to rough fuzzy sets.

关 键 词：粗糙集理论 粗糙度 数据处理 知识集合 

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