The structures and the connections on four types of covering rough sets

被引:0
|
作者
Zhaohao Wang
Hong Wang
Qinrong Feng
机构
[1] Shanxi Normal University,School of Mathematics and Computer Science
来源
Soft Computing | 2019年 / 23卷
关键词
Covering rough set; Geometric lattice; Boolean lattice; Matroid;
D O I
暂无
中图分类号
学科分类号
摘要
Covering rough set model is an important extension of Pawlak rough set model, and its structure is the foundation of covering rough set theory. This paper considers four covering approximations and studies the structures of the families of their covering upper (or lower) definable sets by means of lattice theory. We provide some conditions under which the families of covering upper (or lower) definable sets with respect to these covering approximations are lattices of sets, or distributive lattices, or geometric lattices, or Boolean lattices. Furthermore, based on these results, we give the relationship among the four covering approximations and establish the connection between matroids and covering rough sets from the viewpoint of lattice theory.
引用
收藏
页码:6727 / 6741
页数:14
相关论文
共 50 条
  • [31] Two Types of Single Valued Neutrosophic Covering Rough Sets and an Application to Decision Making
    Wang, Jingqian
    Zhang, Xiaohong
    SYMMETRY-BASEL, 2018, 10 (12):
  • [32] A Comparison of Two Types of Covering-Based Rough Sets Through the Complement of Coverings
    Liu, Yanfang
    Zhu, William
    ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, RSFDGRC 2015, 2015, 9437 : 90 - 101
  • [33] The comparative study of covering rough sets and multi-granulation rough sets
    Qingzhao Kong
    Weihua Xu
    Soft Computing, 2019, 23 : 3237 - 3251
  • [34] Topological properties of locally finite covering rough sets and K-topological rough set structures
    Sang-Eon Han
    Soft Computing, 2021, 25 : 6865 - 6877
  • [35] Topological properties of locally finite covering rough sets and K-topological rough set structures
    Han, Sang-Eon
    SOFT COMPUTING, 2021, 25 (10) : 6865 - 6877
  • [36] The comparative study of covering rough sets and multi-granulation rough sets
    Kong, Qingzhao
    Xu, Weihua
    SOFT COMPUTING, 2019, 23 (10) : 3237 - 3251
  • [37] Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets
    Shakiba, A.
    Hooshmandasl, M. R.
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2016, 75 : 13 - 38
  • [38] A semantically sound approach to Pawlak rough sets and covering-based rough sets
    D'eer, Lynn
    Cornelis, Chris
    Yao, Yiyu
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2016, 78 : 62 - 72
  • [39] ROUGH SETS BASED ON GALOIS CONNECTIONS
    Madrid, Nicolas
    Medina, Jesus
    Ramirez-Poussa, Eloisa
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2020, 30 (02) : 299 - 313
  • [40] RETRACTED: On Three Types of Soft Rough Covering-Based Fuzzy Sets (Retracted Article)
    Atef, Mohammed
    Nada, Shokry
    Gumaei, Abdu
    Nawar, Ashraf S.
    JOURNAL OF MATHEMATICS, 2021, 2021