2016
DOI: 10.1007/s00500-016-2077-2
|View full text |Cite
|
Sign up to set email alerts
|

Rough approximations based on soft binary relations and knowledge bases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 21 publications
0
10
0
Order By: Relevance
“…Li et al [69] presented the generalization of the soft binary relation over U 1 to U 2 , as follows.…”
Section: Definition 3 ([6]mentioning
confidence: 99%
“…Li et al [69] presented the generalization of the soft binary relation over U 1 to U 2 , as follows.…”
Section: Definition 3 ([6]mentioning
confidence: 99%
“…Since RS theory has been developed, many robust generalizations of RS have been established in various directions. For instance, binary relations [24,25], tolerance relations [26], similarity relations [27], soft binary relations [28,29], soft equivalence relations [30], set valued maps [31], two equivalence relations [32], normal soft group [33], etc. Recently, Shiekh et al [34] proposed the solution of matrix games with rough interval pay-offs and its application in the telecom market share problem.…”
Section: Introductionmentioning
confidence: 99%
“…To address these issues, tolerance relations, similarity relations, general binary relations, neighborhood systems, and others are used in place of partitions. Feng et al [16] combined SS with FS and RS, the RSS and SRS are investigated in [17][18][19], the rough set approximation based on SBr and knowledge bases was discussed by Li et al [20], Meng et al [21] discussed SRFS and SFRS, Zhang et al [22] presented novel FRS models and corresponding applications to MCDM. Many authors have blended the concepts of FS and RS in various ways, as demonstrated in [23][24][25][26].…”
Section: Introductionmentioning
confidence: 99%