摘要
覆盖粒计算理论模型的研究大多停留在粒度空间的单个层面上进行讨论。已经有一些学者对覆盖粒度空间的层次进行了一些尝试。通过对目前已有的三种层次模型的分析,发现这些模型中存在一些问题。定义了一种新的覆盖上的偏序较细关系,对其性质进行研究,证明了覆盖近似空间下的概念近似具有偏序关系是覆盖近似空间本身具有偏序较细关系的充要条件。
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 covering 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.
出处
《计算机工程与应用》
CSCD
北大核心
2015年第5期153-155,共3页
Computer Engineering and Applications
基金
国家自然科学基金(No.71371011)
安徽省重大教研项目(No.2013zdjy151)
安徽省高等学校省级自然科学研究重点项目(No.KJ2013A033)
宿州学院教学研究项目(No.szxyjyxm201236)
关键词
粒计算
覆盖粗糙集
偏序关系
层次模型
granular computing
covering rough sets
partial ordering relation
hierarchical model
