AbstractThis paper investigates the general roughness bounds for rough set operations. Compared with set-oriented rough sets, the results prove that the same upper bound of the roughness for the union, difference and complement operation could be determined by the roughness of the two operand sets. However, the lower roughness bounds of set-oriented rough sets operations do not hold for other rough sets. We provide an example to show the derived bounds from the operand’s roughness
An outline of an algebraie generalization of the rough set theory is presented in the paper. It is s...
Abstract. A rough set is a formal approximation of a crisp set which gives lower and upper approxima...
Rough sets, developed by Zdzisław Pawlak [12], are an important tool to describe the state of incomp...
This paper presents some roughness bounds for rough set operations. The results show that a bound of...
The propagation and combination of uncertainties can significantly influence the performance of an i...
AbstractThis paper investigates the general roughness bounds for rough set operations. Compared with...
In this paper, we introduce the notions of generalized upper (lower) approximations, generalized upp...
Abstract—I will analyze Pawlak’s rough sets and extend the usual setting of characterization via an ...
Rough set theory (RST) focuses on forming posets of equivalence relations to describe sets with incr...
Rough Set Theory (RST) is a mathematical formalism for representing uncertainty that can be consider...
AbstractIn rough set theory, the accuracy measure is an important numerical characterization that qu...
Many different proposals exist for the definition of lower and upper approximation operators in cove...
The theory of rough sets is an extension of set theory with two additional unary set-theoretic opera...
The basic concept in algebra that is set theory can be expanded into rough sets. Basic operations on...
This paper proposes new definitions of lower and upper approximations, which are basic concepts of t...
An outline of an algebraie generalization of the rough set theory is presented in the paper. It is s...
Abstract. A rough set is a formal approximation of a crisp set which gives lower and upper approxima...
Rough sets, developed by Zdzisław Pawlak [12], are an important tool to describe the state of incomp...
This paper presents some roughness bounds for rough set operations. The results show that a bound of...
The propagation and combination of uncertainties can significantly influence the performance of an i...
AbstractThis paper investigates the general roughness bounds for rough set operations. Compared with...
In this paper, we introduce the notions of generalized upper (lower) approximations, generalized upp...
Abstract—I will analyze Pawlak’s rough sets and extend the usual setting of characterization via an ...
Rough set theory (RST) focuses on forming posets of equivalence relations to describe sets with incr...
Rough Set Theory (RST) is a mathematical formalism for representing uncertainty that can be consider...
AbstractIn rough set theory, the accuracy measure is an important numerical characterization that qu...
Many different proposals exist for the definition of lower and upper approximation operators in cove...
The theory of rough sets is an extension of set theory with two additional unary set-theoretic opera...
The basic concept in algebra that is set theory can be expanded into rough sets. Basic operations on...
This paper proposes new definitions of lower and upper approximations, which are basic concepts of t...
An outline of an algebraie generalization of the rough set theory is presented in the paper. It is s...
Abstract. A rough set is a formal approximation of a crisp set which gives lower and upper approxima...
Rough sets, developed by Zdzisław Pawlak [12], are an important tool to describe the state of incomp...