The rough sets theory proposed by Pawlak was originally founded on the idea of approximating a given set by means of indiscernibility binary relation, which was assumed to be an equivalence relation (reflexive, symmetric and transitive). With respect to this basic idea, two main theoretical developments have been proposed: some extensions to a fuzzy context (e.g. Dubois and Prade, Slowinski and Stefanowski, Yao) and some extensions of the indiscernibility relation by means of more general binary relations (e.g. Nieminen, Lin, Marcus, Polkowski, Skowron and Zytkow, Skowron and Stepaniuk, Slowinski, Slowinski and Vanderpooten, Yao and Wong). In the latter extensions, we wish to point out the proposal of Slowinski and Vanderpooten who introduced and characterized a general definition of rough approximations using a similarity relation which is a reflexive binary relation, relaxing the assumption of symmetry and transitivity.
|Title of host publication||Rough sets and current trends in computing|
|Subtitle of host publication|| proceedings of the first international conference|
|Editors||Lech Polkowski, Andrzej Skowron|
|Place of Publication||Berlin, Germany|
|Publication status||Published - 1998|
|Name||Lecture notes in computer science|