覆盖粗糙集的偏序关系研究

摘要

The researches about covering granular computing theory focus on single level space. Many researchers have built some hierarchical models on covering granular space. By analyzing the three hierarchical models, it finds they all have some problems. Based on the above discussions, a new partial order relation of hierarchical model is defined in this paper, its corresponding properties are proved. Furthermore, concepts approximately with partial order relation on the cover-ing approximation space is the sufficient and necessary condition of covering approximation space itself with partial order finer relation, which is also provided and proved in the paper.%覆盖粒计算理论模型的研究大多停留在粒度空间的单个层面上进行讨论。已经有一些学者对覆盖粒度空间的层次进行了一些尝试。通过对目前已有的三种层次模型的分析，发现这些模型中存在一些问题。定义了一种新的覆盖上的偏序较细关系，对其性质进行研究，证明了覆盖近似空间下的概念近似具有偏序关系是覆盖近似空间本身具有偏序较细关系的充要条件。