Properties of Different Types of Rough Approximations Defined by a Family of Dominance Relations
A.S. Salama, Essam El-Seidy, A. K. Salah
Abstract
In this study, we examine the properties of three types of lower and upper approximations of a non-empty finite set based on the dominance class generated by the dominance relations. We generalize these types using a family of dominance relations {R i : i = 1, 2, . . . , n} and studying their properties.
Topics & Concepts
Dominance (genetics)Rough setMathematicsComputer scienceArtificial intelligenceBiologyGeneticsGeneRough Sets and Fuzzy Logic