计算机工程与应用Issue(5)：153-155,3.DOI:10.3778/j.issn.1002-8331.1403-0312
覆盖粗糙集的偏序关系研究
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分类
信息技术与安全科学引用本文复制引用
单雪红,吴涛,张文军,高显彩..覆盖粗糙集的偏序关系研究[J].计算机工程与应用,2015,(5):153-155,3.基金项目
国家自然科学基金（No.71371011）；安徽省重大教研项目（No.2013zdjy151）；安徽省高等学校省级自然科学研究重点项目（No.KJ2013A033）；宿州学院教学研究项目（No.szxyjyxm201236）。 （）
