2012
DOI: 10.1007/978-3-642-31709-5_61
|View full text |Cite
|
Sign up to set email alerts
|

A General Set Theoretic Approximation Framework

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…Let B ⊆ 2 U be a nonempty family of nonempty subsets of U . It is a natural assumption that D B is obtained (derived) form B by some sort of set type transformations (for the most important cases, see [5]). In order to build a generalized Pawlakian partial approximation framework, we define D B with the following definition:…”
Section: Fundamental Notions Of Partial Approximation Of Setsmentioning
confidence: 99%
See 1 more Smart Citation
“…Let B ⊆ 2 U be a nonempty family of nonempty subsets of U . It is a natural assumption that D B is obtained (derived) form B by some sort of set type transformations (for the most important cases, see [5]). In order to build a generalized Pawlakian partial approximation framework, we define D B with the following definition:…”
Section: Fundamental Notions Of Partial Approximation Of Setsmentioning
confidence: 99%
“…Thus, not only the pairwise disjoint property but also the covering of the universe are given up. This basically new approach is referred to as partial approximation of sets [5,6,10].…”
Section: Introductionmentioning
confidence: 99%
“…D IFFERENT systems of rough set theory were created in the last forty years: Pawlak's original theory of rough sets (see in e.g. [1]- [3]), covering systems relying on tolerance relations [4], general covering systems [5], [6], decisiontheoretic rough set theory [7], general partial approximation spaces [8], similarity based approximation spaces [9]. There is a very important common property: " all systems rely on given background knowledge represented by the system of base sets; " one cannot say more about an arbitrary set (representing a 'new' property) or about its members than the lower and upper approximations of the set make possible.…”
Section: Introductionmentioning
confidence: 99%
“…Pawlak's answers are 'yes' for both questions (so in his system each object has exactly one property from the given family), whereas covering rough set systems say 'yes' for the first question and no for the second one. A generalization of the theory of rough sets (see in [15], [16]) does not commit itself to answer 'yes' for any mentioned question: It does not suppose either the representations of properties belonging to mentioned family cover the discourse universe or the representations form a pairwise disjoint family of sets. From the approximation point of view the generalization can be considered as a system of partial approximation of sets.…”
Section: Introductionmentioning
confidence: 99%