摘要
粗糙包含关系是粗糙集理论中一个重要概念,粗糙包含关系也是近似空间中的一个拟序关系。文章给出了在同一近似空间中比较两个不同粗糙集的包含可能度的计算公式,研究了粗糙包含可能度的性质,并讨论了粗糙包含度、粗糙度和划分加细关系之间的联系。
The rough relation plays an important role in rough set theory,and it is also a quasi-odering.The paper pre-sents a inclusion possibility degree computing formula for the comparison between two rough sets in a approximate space,and their desirable properties are studied.Based on possibility degree formulas,relationships between contain possi-bility roughness and a refinement order relation are discussed.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第28期24-25,35,共3页
Computer Engineering and Applications
基金
陕西省自然科学基金资助(编号:2001SL08)
关键词
粗糙集
包含可能度
粗糙度
加细序
Rough set,Inclusion possibility degree,Roughness,Refinement order
