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

Computer Engineering and Applications 计算机工程与应用 2015 ，51（5 ） 153 覆盖粗糙集的偏序关系研究 1 2 3 1 单雪红 ，吴 涛 ，张文军 ，高显彩 1 2 3 1 SHAN Xuehong , WU Tao , ZHANG Wenjun , GAO Xiancai 1.宿州学院 数学与统计学院，安徽 宿州 234000 2.安徽大学 数学科学学院，合肥 230039 3.宿州二中，安徽 宿州 234000 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 SHAN Xuehong, WU Tao, ZHANG Wenjun, et al. Partial ordering relation on covering rough sets. Computer Engi- neering and Applications, 2015, 51 （5 ）：153-155. 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 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. Key words ：granular computing; covering rough sets; partial ordering relation; hierarchical model 摘 要：覆盖粒计算理论模型的研究大多停留在粒度空间的单个层面上进行讨论。已经有一些学者对覆盖粒度空 间的层次进行了一些尝试。通过对目前已有的三种层次模型的分析，发现这些模型中存在一些问题。定义了一种 新的覆盖上的偏序较细关系，对其性质进行研究，证明了覆盖近似空间下的概念近似具有偏序关系是覆盖近似空间 本身具有偏序较细关系的充要条件。 关键词：粒计算；覆盖粗糙集；偏序关系；层次模型 文献标志码：A 中图分类号：TP 18 doi ：10.3778/j.issn. 1002-8331.1403-0312 1 引言 的研究范畴[2-3] 。经典粗糙集理论是基于等价关系的硬 粒计算通过对现实问题进行多角度、多层次的描述 划分，即它的知识为论域上的划分，也即知识中的概念 和理解，从而得到问题的