Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Formal topology and information systems
Transactions on rough sets VI
Generalized rough sets and implication lattices
Transactions on rough sets XIV
Hi-index | 0.00 |
Approximation Spaces were introduced in order to analyse data on the basis of Indiscernibility Spaces, that is, spaces of the form 〈U, E〉, where U is the universe of data and E is an equivalence relation on U. Various authors suggested considering spaces of the form 〈U, R〉, where R is any relation. This paper aims at introducing a further step consisting in spaces of the form 〈U, {R}i∈I〉, where {R}i∈I is a family of relations on U, that we call "Dynamic Spaces", because they make it possible to account for different forms of dynamics. While Indiscernibility Spaces induce 0-dimensional topological spaces (Approximation Spaces), Dynamic Spaces induce various types of pre-topological spaces.