Reasoning with rough sets
S Akama, T Murai, Y Kudo - … Approaches to Granularity-Based Framework, 2018 - Springer
S Akama, T Murai, Y Kudo
Logical Approaches to Granularity-Based Framework, 2018•SpringerPawlak proposed rough set theory in 1982. It can be seen as an extension of set theory, in
which a subset of a universe is formalized by a pair of sets, ie, the lower and upper
approximations. These approximations can be described by two operators on subsets of the
universe. In rough set theory, an equivalence relation, ie, reflexive, symmetric, and transitive
relation, plays an important role. Namely, the lower approximation of a given set is the union
of all equivalence classes which are subset of the set, and the upper approximation is the …
which a subset of a universe is formalized by a pair of sets, ie, the lower and upper
approximations. These approximations can be described by two operators on subsets of the
universe. In rough set theory, an equivalence relation, ie, reflexive, symmetric, and transitive
relation, plays an important role. Namely, the lower approximation of a given set is the union
of all equivalence classes which are subset of the set, and the upper approximation is the …
Pawlak proposed rough set theory in 1982. It can be seen as an extension of set theory, in which a subset of a universe is formalized by a pair of sets, ie, the lower and upper approximations. These approximations can be described by two operators on subsets of the universe.
In rough set theory, an equivalence relation, ie, reflexive, symmetric, and transitive relation, plays an important role. Namely, the lower approximation of a given set is the union of all equivalence classes which are subset of the set, and the upper approximation is the union of all equivalence classes which have a non-empty intersection with the set.
Springer
Showing the best result for this search. See all results