2020
DOI: 10.3233/jifs-191542
|View full text |Cite
|
Sign up to set email alerts
|

Certain types of coverings based rough sets with application

Abstract: Covering-based rough sets are important generalizations of the classical rough sets of Pawlak. In this paper, by means of j-neighborhoods, complementary j-neighborhoods and j-adhesions, we build some new different types of j-covering approximations based rough sets and study related properties. Also, we explore the relationships between the considered j-covering approximations and investigate the properties of them. Using different neighborhoods, some different general topologies are generated as topologies in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(11 citation statements)
references
References 34 publications
0
11
0
Order By: Relevance
“…In covering-based rough sets, an adhesion-set is introduced [21]. Nawar et al [22] utilized it to define the j-adhesion neighbourhood formed by any binary relation, and they proposed different types of covering-based rough sets as a result. Furthermore, Atef et al [23] provided six rough approximations derived by j-adhesion neighbourhoods utilizing j-neighbourhood space [8] which was modified by El-Bably et al in [5].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In covering-based rough sets, an adhesion-set is introduced [21]. Nawar et al [22] utilized it to define the j-adhesion neighbourhood formed by any binary relation, and they proposed different types of covering-based rough sets as a result. Furthermore, Atef et al [23] provided six rough approximations derived by j-adhesion neighbourhoods utilizing j-neighbourhood space [8] which was modified by El-Bably et al in [5].…”
Section: Introductionmentioning
confidence: 99%
“…Rough set theory was established by computer scientist Pawlak [24,25] based on several difficulties in computer science to overcome this challenge by a modal approximation of a crisp set in the expressions of a pair of sets called the rough approximations of it. Many writers have focused on generalization rough sets [2,4,8,11,13,20,22,23,[26][27][28][29][30][31][32][33][34][35][36][37][38][39].…”
Section: Introductionmentioning
confidence: 99%
“…Using soft β -rough approximations and soft rough topologies, which are generated by soft β -rough approximations, we make a topological reduction for the information system and then we identify the impact factors for transmission of COVID-19 infection into the human. Moreover, we can say that the suggested methods can be used to analyze data of COVID-19 with quantitative or qualitative data [35,36]. By coding qualitative data of the information system in the application, we express "yes" and "no" with " 1 " and " 0 " values, respectively, and obtain soft β -rough sets.…”
Section: Introductionmentioning
confidence: 99%
“…erefore application of this technique is very limited. erefore authors relaxed the condition of equivalence relation by some more general relations such as similarity relations (reflexive and symmetric) [5,6], preorder relations (reflexive and transitive) [7], reflexive relations [8], general binary relations [8][9][10][11][12][13][14], topological approaches [15,16], and coverings [17][18][19].…”
Section: Introductionmentioning
confidence: 99%