Rough Sets by Indiscernibility Relations in Data Sets Containing Possibilistic Information

摘要

Under data sets containing possibilistic information, rough sets are described by directly using indiscernibility relations. First, we give rough sets based on indiscernibility relations under complete information. Second, we address rough sets by applying possible world semantics to data sets with possibilistic information. The rough sets are used as a correctness criterion of approaches extended to deal with possibilistic information. Third, we extend the approach based on indiscernibility relations to handle data sets with possibilistic information. Rough sets in this extension creates the same results as ones obtained under possible world semantics. This gives justification to our extension.