362 research outputs found
Matroidal approaches to rough sets via closure operators
AbstractThis paper studies rough sets from the operator-oriented view by matroidal approaches. We firstly investigate some kinds of closure operators and conclude that the Pawlak upper approximation operator is just a topological and matroidal closure operator. Then we characterize the Pawlak upper approximation operator in terms of the closure operator in Pawlak matroids, which are first defined in this paper, and are generalized to fundamental matroids when partitions are generalized to coverings. A new covering-based rough set model is then proposed based on fundamental matroids and properties of this model are studied. Lastly, we refer to the abstract approximation space, whose original definition is modified to get a one-to-one correspondence between closure systems (operators) and concrete models of abstract approximation spaces. We finally examine the relations of four kinds of abstract approximation spaces, which correspond exactly to the relations of closure systems
The Relation Between Rough Sets And Fuzzy Sets Via Topological Spaces
Abstract: Theories of rough sets and fuzzy sets are related and complementary methodologies to handle uncertainty of vagueness and coarseness, respectively. They are generalizations of classical set theory for modeling vagueness and uncertainty. A fundamental question concerning both theories is their connections and differences. There have been many studies on this topic. Topology is a branch of mathematics, whose ideas exist not only in almost all branches of mathematics but also in many real life applications. The topological structure on an abstract set is used as the base, which used to extract knowledge from data. In this paper: topological structure is used to study the relation between rough sets and fuzzy sets. Membership function is used to convert from rough set to fuzzy set and vice versa. This conversion will achieve the advantages of two theories. Some examples and theories are introduced to indicate the importance of using general binary relations in the construction of rough set concepts, and indicate the relation between rough sets and fuzzy sets according to the topological spaces
Algebraic Models for Qualified Aggregation in General Rough Sets, and Reasoning Bias Discovery
In the context of general rough sets, the act of combining two things to form
another is not straightforward. The situation is similar for other theories
that concern uncertainty and vagueness. Such acts can be endowed with
additional meaning that go beyond structural conjunction and disjunction as in
the theory of -norms and associated implications over -fuzzy sets. In the
present research, algebraic models of acts of combining things in generalized
rough sets over lattices with approximation operators (called rough convenience
lattices) is invented. The investigation is strongly motivated by the desire to
model skeptical or pessimistic, and optimistic or possibilistic aggregation in
human reasoning, and the choice of operations is constrained by the
perspective. Fundamental results on the weak negations and implications
afforded by the minimal models are proved. In addition, the model is suitable
for the study of discriminatory/toxic behavior in human reasoning, and of ML
algorithms learning such behavior.Comment: 15 Pages. Accepted. IJCRS-202
Rough sets based on Galois connections
Rough set theory is an important tool to extract knowledge from relational databases. The original definitions of approximation operators are based on an indiscernibility relation, which is an equivalence one. Lately. different papers have motivated the possibility of considering arbitrary relations. Nevertheless, when those are taken into account, the original definitions given by Pawlak may lose fundamental properties. This paper proposes a possible solution to the arising problems by presenting an alternative definition of approximation operators based on the closure and interior operators obtained from an isotone Galois connection. We prove that the proposed definition satisfies interesting properties and that it also improves object classification tasks
Rough sets, their extensions and applications
Rough set theory provides a useful mathematical foundation for developing automated computational systems that can help understand and make use of imperfect knowledge. Despite its recency, the theory and its extensions have been widely applied to many problems, including decision analysis, data-mining, intelligent control and pattern recognition. This paper presents an outline of the basic concepts of rough sets and their major extensions, covering variable precision, tolerance and fuzzy rough sets. It also shows the diversity of successful applications these theories have entailed, ranging from financial and business, through biological and medicine, to physical, art, and meteorological
- …