Approximation of sets based on partial covering
The paper presents a generalization of the rough set theory. The starting point is an arbitrary nonempty family \(\mathfrak{B}\) of subsets of an arbitrary nonempty universe of discourse \(U\); its elements are called \(\mathfrak{B}\)-sets. In analogy to the definition of the \(\sigma\)-algebra \(\sigma(U/\varepsilon)\), \(\mathfrak{D}_{\mathfrak{B}}\) represents the extension of \(\mathfrak{B}\) with the empty set and all the unions of some \(\mathfrak{B}\)-sets. The notions of lower and upper approximations are straightforward point-free generalizations of Pawlak's same approximations imitating the \(\varepsilon\)-elementary set based formulations; both of them belong to \(\mathfrak{D}_{\mathfrak{B}}\). The entire discussion is within an overall approximation framework whose scope ranges from weak approximation pairs of maps on \(U\) to the notion of a Galois connection on \(2^U\). The common features of the rough set theory and the approach from this paper are treated uniformly, and most notions of Pawlak's rough set theory constitute compound ones and they are split into two or more parts; this framework helps to understand the state of their compound nature and to specify their constituents in a more general context. To demonstrate the effectiveness of the proposed approach a real life biological example is examined. It is based on the META program which is a grid-based, landscape-ecology-oriented, satellite-image supported, field vegetation mapping method of Hungarian habitats.
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- A unifying study between modal-like operators, topologies and fuzzy sets
- Approximate Boolean Reasoning: Foundations and Applications in Data Mining
- Approximation Theories: Granular Computing vs Rough Sets
- Constructive and algebraic methods of the theory of rough sets
- Continuous Lattices and Domains
- Extensions and intensions in the rough set theory
- scientific article; zbMATH DE number 3880694 (Why is no real title available?)
- scientific article; zbMATH DE number 5129611 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 58943 (Why is no real title available?)
- scientific article; zbMATH DE number 68515 (Why is no real title available?)
- scientific article; zbMATH DE number 701387 (Why is no real title available?)
- scientific article; zbMATH DE number 1182785 (Why is no real title available?)
- scientific article; zbMATH DE number 1983063 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 2113955 (Why is no real title available?)
- scientific article; zbMATH DE number 2118880 (Why is no real title available?)
- Information granulation and rough set approximation
- Information granules: Towards foundations of granular computing
- Lattice Theory for Rough Sets
- Modal-like operators in Boolean lattices, Galois connections and fixed points
- Relationship between generalized rough sets based on binary relation and covering
- Rough Set Approximations in Formal Concept Analysis
- Rough sets
- Rough sets determined by quasiorders
- Rudiments of rough sets
- Theory and Applications of Relational Structures as Knowledge Instruments
- Topological approaches to covering rough sets
- Transactions on Rough Sets III
- Two views of the theory of rough sets in finite universes
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction
- Effective hull of a set and its approximation
- Four matroidal structures of covering and their relationships with rough sets
- Algebraic representation, dualities and beyond
- Approximate Set Covering in Uniform Hypergraphs
- Approximation of sets based on partial covering
- Helly-type theorems for approximate covering
This page was built for publication: Approximation of sets based on partial covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642525)