首页> 外文会议>2011 IEEE International Conference on Granular Computing >The refinement in covering-based rough sets
【24h】

The refinement in covering-based rough sets

机译:基于覆盖的粗糙集的改进

获取原文

摘要

In the studies on covering-based rough sets, there are few discussions about the relation between a covering-element and objects in the covering-element. But it is actually a significant problem. In this paper, we give some better studies on the refinement of covering. Based on the refinement, some important concepts such as minimal description and neighborhood in covering-based rough sets are discussed. The properties of several coverings which generate the same refinement are studied as well. Finally, we compare the approximation sets of four models of covering-based rough sets before and after the refinement. The refinement can help us to better understand and study covering-based rough sets from a new viewpoint.
机译:在基于覆盖的粗糙集的研究中,关于覆盖元素和覆盖元素中的对象之间的关系的讨论很少。但这实际上是一个重大问题。在本文中,我们对覆盖层的细化进行了更好的研究。在细化的基础上,讨论了一些重要的概念,例如基于覆盖的粗糙集中的最小描述和邻域。还研究了产生相同细化的几种覆盖物的性能。最后,我们比较了精炼前后基于覆盖的粗糙集的四个模型的近似集。改进可以帮助我们从新的角度更好地理解和研究基于覆盖的粗糙集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号