Covering-Based Pessimistic Multigranular Approximate Rough Equivalences and Approximate Reasoning

被引:1
|
作者
Tripathy, B. K. [1 ]
Parida, Suvendu K. [2 ]
机构
[1] VIT Univ, SCOPE, Vellore, Tamil Nadu, India
[2] SCS Autonomous Coll, Puri 752001, Odisha, India
来源
SMART COMPUTING AND INFORMATICS | 2018年 / 77卷
关键词
Rough sets; CBRS; Multigranulations; CBMG; Approximate rough equivalence; Approximate reasoning; EQUALITIES;
D O I
10.1007/978-981-10-5544-7_30
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The multigranular rough set (MGRS) models of Qian et al. were extended to put forth covering-based multigranular rough sets (CBMGRS) by Liu et al. in 2012. The equality of sets, which is restrictive and redundant, was extended first in Pawlak (Rough sets: theoretical aspects of reasoning about data. Kluwer, London, 1991) and subsequently in Tripathy (Int J Adv Sci Technol 31:23-36, 2011) to propose four types of rough set-based approximate equalities. These basic concepts of rough equalities have been extended to several generalized rough set models. In this paper, covering-based pessimistic multigranular (CBPMG) approximate rough equivalence is introduced and several of their properties are established. Real life examples are taken for constructing counter examples and also for illustration. We have also discussed how these equalities can be applied in approximate reasoning and our latest proposal is no exception.
引用
收藏
页码:299 / 309
页数:11
相关论文
共 50 条
  • [1] On the Approximate Equalities of Multigranular Rough Sets and Approximate Reasoning
    Tripathy, B. K.
    Mitra, Anirban
    2013 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS AND NETWORKING TECHNOLOGIES (ICCCNT), 2013,
  • [2] On Multigranular Approximate Rough Equivalence of Sets and Approximate Reasoning
    Tripathy, B. K.
    Saraf, Prateek
    Parida, S. Ch.
    COMPUTATIONAL INTELLIGENCE IN DATA MINING, VOL 2, 2015, 32 : 605 - 616
  • [3] On Covering based Pessimistic Multigranular Rough Sets
    Tripathy, B. K.
    Govindarajulu, K.
    2014 6TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMMUNICATION NETWORKS, 2014, : 708 - 713
  • [4] A Covering-Based Pessimistic Multigranulation Rough Set
    Lin, Guoping
    Li, Jinjin
    BIO-INSPIRED COMPUTING AND APPLICATIONS, 2012, 6840 : 673 - 680
  • [5] Some More Properties of Covering Based Pessimistic Multigranular Rough Sets
    Tripathy, B. K.
    Govindarajulu, K.
    INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 1, 2015, 339 : 555 - 564
  • [6] Rough sets, modal logic and approximate reasoning
    Chakraborty, Mihir Kr.
    Majumder, Sandip
    Kar, Samarjit
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2025, 176
  • [7] On twelve types of covering-based rough sets
    Safari, Samira
    Hooshmandas, Mohammad Reza
    SPRINGERPLUS, 2016, 5
  • [8] On three types of covering-based rough sets
    Zhu, William
    Wang, Fei-Yue
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2007, 19 (08) : 1131 - 1144
  • [9] Neighborhood operators for covering-based rough sets
    D'eer, Lynn
    Restrepo, Mauricio
    Cornelis, Chris
    Gomez, Jonatan
    INFORMATION SCIENCES, 2016, 336 : 21 - 44
  • [10] Rough mereology: A new paradigm for approximate reasoning
    Polkowski, L
    Skowron, A
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 1996, 15 (04) : 333 - 365