2015
DOI: 10.14419/ijamr.v4i2.4517
|View full text |Cite
|
Sign up to set email alerts
|

Approximation operators by using finite family of reflexive relations

Abstract: In this paper, we generalize the two types of Yao's lower and upper approximations, using finite number of reflexive relations. Moreover, we give a comparison between these types and study some properties.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 52 publications
0
1
0
Order By: Relevance
“…He also in [2], introduced a comparison between different kinds of approximations using a family of binary relations. He with Salama in [3,4] δβ-open sets have opened the door about using other topological approaches for information systems. In our approach we used any finite number of binary relations defined on attributes of an information system to generate two topological spaces and used them in generalizations.…”
Section: Introductionmentioning
confidence: 99%
“…He also in [2], introduced a comparison between different kinds of approximations using a family of binary relations. He with Salama in [3,4] δβ-open sets have opened the door about using other topological approaches for information systems. In our approach we used any finite number of binary relations defined on attributes of an information system to generate two topological spaces and used them in generalizations.…”
Section: Introductionmentioning
confidence: 99%