| 关于近似空间中粗糙包含可能度的研究 |
| |
| 引用本文： | 邓方安. 关于近似空间中粗糙包含可能度的研究[J]. 计算机工程与应用, 2003, 39(28): 24-25,35 |
| |
| 作者姓名： | 邓方安 |
| |
| 作者单位： | 陕西理工学院数学与计算机科学系,汉中,723001 |
| |
| 基金项目： | 陕西省自然科学基金资助(编号:2001SL08) |
| |
| 摘 要： | 粗糙包含关系是粗糙集理论中一个重要概念,粗糙包含关系也是近似空间中的一个拟序关系。文章给出了在同一近似空间中比较两个不同粗糙集的包含可能度的计算公式,研究了粗糙包含可能度的性质,并讨论了粗糙包含度、粗糙度和划分加细关系之间的联系。
|
| 关 键 词： | 粗糙集 包含可能度 粗糙度 加细序 |
| 文章编号： | 1002-8331-(2003)28-0024-02 |
The Study of the Inclusion Possibility Degree for Two Rough Sets in an Approximate Space |
| |
| Deng Fangan. The Study of the Inclusion Possibility Degree for Two Rough Sets in an Approximate Space[J]. Computer Engineering and Applications, 2003, 39(28): 24-25,35 |
| |
| Authors: | Deng Fangan |
| |
| Abstract: | 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. |
| |
| Keywords: | Rough set Inclusion possibility degree Roughness Refinement order |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
