Computer Engineering and Applications ›› 2015, Vol. 51 ›› Issue (5): 153-155.

Previous Articles     Next Articles

Partial ordering relation on covering rough sets

SHAN Xuehong1, WU Tao2, ZHANG Wenjun3, GAO Xiancai1   

  1. 1.School of Mathematics & Statistics, Suzhou University, Suzhou, Anhui 234000, China
    2.School of Mathematical Sciences, Anhui University, Hefei 230039, China
    3.Suzhou No.2 High School, Suzhou, Anhui 234000, China
  • Online:2015-03-01 Published:2015-04-08

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

单雪红1,吴  涛2,张文军3,高显彩1   

  1. 1.宿州学院 数学与统计学院,安徽 宿州 234000
    2.安徽大学 数学科学学院,合肥 230039
    3.宿州二中,安徽 宿州 234000

Abstract: 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.

Key words: granular computing, covering rough sets, partial ordering relation, hierarchical model

摘要: 覆盖粒计算理论模型的研究大多停留在粒度空间的单个层面上进行讨论。已经有一些学者对覆盖粒度空间的层次进行了一些尝试。通过对目前已有的三种层次模型的分析,发现这些模型中存在一些问题。定义了一种新的覆盖上的偏序较细关系,对其性质进行研究,证明了覆盖近似空间下的概念近似具有偏序关系是覆盖近似空间本身具有偏序较细关系的充要条件。

关键词: 粒计算, 覆盖粗糙集, 偏序关系, 层次模型