80,905 research outputs found
Variable Precision Rough Set Approximations in Concept Lattice
The notions of variable precision rough set and concept lattice are can be shared by a basic notion, which is the definability of a set of objects based on a set of properties. The two theories of rough set and concept lattice can be compared, combined and applied to each other based on definability. Based on introducing the definitions of variable precision rough set and concept lattice, this paper shows that any extension of a concept in concept lattice is an equivalence class of variable precision rough set. After that, we present a definition of lower and upper approximations in concept lattice and generate the lower and upper approximations concept of concept lattice. Afterwards, we discuss the properties of the new lower and upper approximations. Finally, an example is given to show the validity of the properties that the lower and upper approximations have
Roughness in Anti Semigroup
In this paper, we present the concepts of the upper and lower approximations
of Anti-rough subgroups, Anti-rough subsemigroups, and homeomorphisms of
Anti-Rough anti-semigroups in approximation spaces. Specify the concepts of
rough in Finite anti-groups of types(4) are studies. Moreover, some properties
of approximations and these algebraic structures are introduced. In addition,
we give the definition of homomorphism anti-group
Covering rough sets based on neighborhoods: An approach without using neighborhoods
Rough set theory, a mathematical tool to deal with inexact or uncertain
knowledge in information systems, has originally described the indiscernibility
of elements by equivalence relations. Covering rough sets are a natural
extension of classical rough sets by relaxing the partitions arising from
equivalence relations to coverings. Recently, some topological concepts such as
neighborhood have been applied to covering rough sets. In this paper, we
further investigate the covering rough sets based on neighborhoods by
approximation operations. We show that the upper approximation based on
neighborhoods can be defined equivalently without using neighborhoods. To
analyze the coverings themselves, we introduce unary and composition operations
on coverings. A notion of homomorphismis provided to relate two covering
approximation spaces. We also examine the properties of approximations
preserved by the operations and homomorphisms, respectively.Comment: 13 pages; to appear in International Journal of Approximate Reasonin
The investigation of the Bayesian rough set model
AbstractThe original Rough Set model is concerned primarily with algebraic properties of approximately defined sets. The Variable Precision Rough Set (VPRS) model extends the basic rough set theory to incorporate probabilistic information. The article presents a non-parametric modification of the VPRS model called the Bayesian Rough Set (BRS) model, where the set approximations are defined by using the prior probability as a reference. Mathematical properties of BRS are investigated. It is shown that the quality of BRS models can be evaluated using probabilistic gain function, which is suitable for identification and elimination of redundant attributes
The investigation of the Bayesian rough set model
AbstractThe original Rough Set model is concerned primarily with algebraic properties of approximately defined sets. The Variable Precision Rough Set (VPRS) model extends the basic rough set theory to incorporate probabilistic information. The article presents a non-parametric modification of the VPRS model called the Bayesian Rough Set (BRS) model, where the set approximations are defined by using the prior probability as a reference. Mathematical properties of BRS are investigated. It is shown that the quality of BRS models can be evaluated using probabilistic gain function, which is suitable for identification and elimination of redundant attributes
A comparison of two types of rough sets induced by coverings
Rough set theory is an important technique in knowledge discovery in databases. In covering-based rough sets, many types of rough set models were established in recent years. In this paper, we compare the covering-based rough sets defined by Zhu with ones defined by Xu and Zhang. We further explore the properties and structures of these types of rough set models. We also consider the reduction of coverings. Finally, the axiomatic systems for the lower and upper approximations defined by Xu and Zhang are constructed
- …