2020
DOI: 10.3390/math8071121
|View full text |Cite
|
Sign up to set email alerts
|

Three-Way Decisions Making Using Covering Based Fractional Orthotriple Fuzzy Rough Set Model

Abstract: On the basis of decision-theoretical rough sets (DTRSs), the three-way decisions give new model of decision approach for deal with the problem of decision. This proposed model of decision method is based on the loss function of DTRSs. First, the concept of fractional orthotriple fuzzy β -covering (FOF β -covering) and fractional orthotriple fuzzy β -neighborhood (FOF β -neighborhood) was introduced. We combined loss feature of DTRSs with covering-based fractional orthotriple fuzzy r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 27 publications
(16 citation statements)
references
References 73 publications
0
16
0
Order By: Relevance
“…• we put f = 1 and η = υ = 0 in definition (5), then FOFS reduces to FS This remark identifies that SFS, PyFS, PFS, IFS, and FS are the special cases of FOFS [44].…”
Section: Remark 1 We Know That Ifmentioning
confidence: 92%
See 2 more Smart Citations
“…• we put f = 1 and η = υ = 0 in definition (5), then FOFS reduces to FS This remark identifies that SFS, PyFS, PFS, IFS, and FS are the special cases of FOFS [44].…”
Section: Remark 1 We Know That Ifmentioning
confidence: 92%
“…Recently, Wei et al [42] proposed the SMs of SFS using the cosine function. Shougi et al [44] defined a three-way DM using covering based FOF Rough Set Model.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…fuzzy rough sets applies fuzzy equivalence classes, making use of fuzzy indiscernibility [40,41]. It allows for expressing imprecise knowledge about similarity and dissimilarity between objects by fuzzy membership functions.…”
Section: Other Rough Set Approachesmentioning
confidence: 99%
“…We assume that one attribute a belongs to the B set, where B ⊆ A . For the B set, if I ( B ) = I ( B − { a }), then attribute a is unnecessary; however, for a specific case in which the above formula is unfulfilled, attribute a is necessary from the B set [ 42 ]. The unnecessary attributes are removed from the subsets, and these are then called the reduced sets [ 43 ].…”
Section: Related Workmentioning
confidence: 99%