Lecture Notes in Computer Science
DOI: 10.1007/978-3-540-71200-8_22
|View full text |Cite
|
Sign up to set email alerts
|

Lattice Theory for Rough Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
53
0

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 105 publications
(54 citation statements)
references
References 40 publications
1
53
0
Order By: Relevance
“…The operators and may be viewed as rough approximation operators [13][14][15]28], and the operators and are sometimes interpreted as modifier operators [20,25]. Also other types of definitions for these operators can be found in the literature; see [7] for a survey.…”
Section: Modal-like Operatorsmentioning
confidence: 99%
“…The operators and may be viewed as rough approximation operators [13][14][15]28], and the operators and are sometimes interpreted as modifier operators [20,25]. Also other types of definitions for these operators can be found in the literature; see [7] for a survey.…”
Section: Modal-like Operatorsmentioning
confidence: 99%
“…The idea of property (A) comes from the concept of a Galois connection [30,56]: let U 1 and U 2 be two universes and f : U 1 → U 2 and g: U 2 → U 1 two mappings between these universes. We call (f, g) a Galois connection in (U 1 , U 2 ) if for all x ∈ U 1 and y ∈ U 2 it holds that…”
Section: Rough Setsmentioning
confidence: 99%
“…Basic properties of lower and upper ε-approximations can be found, e.g, in [10,16]. Here we cite only a few among them which will be important in the following.…”
Section: Basics Of Pawlak's Rough Set Theorymentioning
confidence: 99%
“…A natural way of the generalization of Pawlak's idea is that the equivalence relation is replaced by any other type of binary relations on U [10,11,24]. Another generalization is the assumption that the starting point is an arbitrary covering of the universe [1,23,26,27].…”
Section: Introductionmentioning
confidence: 99%