Rough Set Theory: Ontological Systems, Entailment Relations and Approximation Operators

Author(s):  
Marcin Wolski
Filomat ◽  
2017 ◽  
Vol 31 (19) ◽  
pp. 6175-6183
Author(s):  
Yan-Lan Zhang ◽  
Chang-Qing Li

Rough set theory is an important tool for data mining. Lower and upper approximation operators are two important basic concepts in the rough set theory. The classical Pawlak rough approximation operators are based on equivalence relations and have been extended to relation-based generalized rough approximation operators. This paper presents topological properties of a pair of relation-based generalized rough approximation operators. A topology is induced by the pair of generalized rough approximation operators from an inverse serial relation. Then, connectedness, countability, separation property and Lindel?f property of the topological space are discussed. The results are not only beneficial to obtain more properties of the pair of approximation operators, but also have theoretical and actual significance to general topology.


2011 ◽  
Vol 282-283 ◽  
pp. 287-290
Author(s):  
Hai Dong Zhang ◽  
Yan Ping He

As a suitable mathematical model to handle partial knowledge in data bases, rough set theory is emerging as a powerful theory and has been found its successive applications in the fields of artificial intelligence such as pattern recognition, machine learning, etc. In the paper, a vague relation is first defined, which is the extension of fuzzy relation. Then a new pair of lower and upper generalized rough approximation operators based on the vague relation is first proposed by us. Finally, the representations of vague rough approximation operators are presented.


2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Ying Zhuang ◽  
Wenqi Liu ◽  
Chin-Chia Wu ◽  
Jinhai Li

The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to rough set theory. We also investigate molecule Pawlak algebra and obtain some related properties.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yan-Lan Zhang ◽  
Chang-Qing Li

The reductions of covering information systems in terms of covering approximation operators are one of the most important applications of covering rough set theory. Based on the connections between the theory of topology and the covering rough set theory, two kinds of topological reductions of covering information systems are discussed in this paper, which are characterized by the belief and plausibility functions from the evidence theory. The topological spaces by two pairs of covering approximation operators in covering information systems are pseudo-discrete, which deduce partitions. Then, using plausibility function values of the sets in the partitions, the definitions of significance and relative significance of coverings are presented. Hence, topological reduction algorithms based on the evidence theory are proposed in covering information systems, and an example is adopted to illustrate the validity of the algorithms.


Filomat ◽  
2018 ◽  
Vol 32 (9) ◽  
pp. 3129-3141
Author(s):  
Yan-Lan Zhang ◽  
Chang-Qing Li

Rough set theory is one of important models of granular computing. Lower and upper approximation operators are two important basic concepts in rough set theory. The classical Pawlak approximation operators are based on partition and have been extended to covering approximation operators. Covering is one of the fundamental concepts in the topological theory, then topological methods are useful for studying the properties of covering approximation operators. This paper presents topological properties of a type of granular based covering approximation operators, which contains seven pairs of approximation operators. Then, topologies are induced naturally by the seven pairs of covering approximation operators, and the topologies are just the families of all definable subsets about the covering approximation operators. Binary relations are defined from the covering to present topological properties of the topological spaces, which are proved to be equivalence relations. Moreover, connectedness, countability, separation property and Lindel?f property of the topological spaces are discussed. The results are not only beneficial to obtain more properties of the pairs of covering approximation operators, but also have theoretical and actual significance to general topology.


2021 ◽  
pp. 1-11
Author(s):  
Yan-Lan Zhang ◽  
Chang-Qing Li

The rough set theory and the evidence theory are two important methods used to deal with uncertainty. The relationships between the rough set theory and the evidence theory have been discussed. In covering rough set theory, several pairs of covering approximation operators are characterized by belief and plausibility functions. The purpose of this paper is to review and examine interpretations of belief functions in covering approximation operators. Firstly, properties of the belief structures induced by two pairs of covering approximation operators are presented. Then, for a belief structure with the properties, there exists a probability space with a covering such that the belief and plausibility functions defined by the given belief structure are, respectively, the belief and plausibility functions induced by one of the two pairs of covering approximation operators. Moreover, two necessary and sufficient conditions for a belief structure to be the belief structure induced by one of the two pairs of covering approximation operators are presented.


2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Weidong Tang ◽  
Jinzhao Wu ◽  
Dingwei Zheng

The core concepts of rough set theory are information systems and approximation operators of approximation spaces. Approximation operators draw close links between rough set theory and topology. This paper is devoted to the discussion of fuzzy rough sets and their topological structures. Fuzzy rough approximations are further investigated. Fuzzy relations are researched by means of topology or lower and upper sets. Topological structures of fuzzy approximation spaces are given by means of pseudoconstant fuzzy relations. Fuzzy topology satisfying (CC) axiom is investigated. The fact that there exists a one-to-one correspondence between the set of all preorder fuzzy relations and the set of all fuzzy topologies satisfying (CC) axiom is proved, the concept of fuzzy approximating spaces is introduced, and decision conditions that a fuzzy topological space is a fuzzy approximating space are obtained, which illustrates that we can research fuzzy relations or fuzzy approximation spaces by means of topology and vice versa. Moreover, fuzzy pseudoclosure operators are examined.


Author(s):  
Wei-Zhi Wu ◽  
Wen-Xiu Zhang

Rough set theory is one of the most advanced areas popularizing GrC. The basic notions in rough set theory are the lower and upper approximation operators. A rough set algebra is a set algebra with two additional lower and upper approximation operators. In this chapter, we analyze relation based rough set algebras in both crisp and fuzzy environments. We first review the constructive definitions of generalized crisp rough approximation operators, rough fuzzy approximation operators, and fuzzy rough approximation operators. We then present the essential properties of the corresponding lower and upper approximation operators. We also characterize the approximation operators by using the axiomatic approach. Finally, the connection between fuzzy rough set algebras and fuzzy topological spaces is established.


Sign in / Sign up

Export Citation Format

Share Document