Rough approximation operators in covering approximation spaces. (English) Zbl 1162.68693

Li, Tong-Jun

Greco, Salvatore (ed.) et al., Rough sets and current trends in computing. 5th international conference, RSCTC 2006, Kobe, Japan, November 6–8, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-47693-1/pbk). Lecture Notes in Computer Science 4259. Lecture Notes in Artificial Intelligence, 174-182 (2006).

Summary: In this paper, we focus on the study of covering based rough sets in covering approximation spaces. Firstly, two pairs of covering approximation operators are reviewed, their properties are investigated. Secondly, Based on the covering of the covering approximation space, two new coverings of the universe are induced, by which two new pairs of covering approximation operators are constructed. Furthermore, the properties of these operators are examined. Finally, by a comparison of these approximation operators, some conditions are gained under which some or all of these approximation operators are equivalent.
For the entire collection see [Zbl 1147.68006].

MSC:

68T37

Reasoning under uncertainty in the context of artificial intelligence

Keywords:

approximation operators; coverings; partitions; rough sets