Applying Rough Sets to Data Tables Containing Possibilistic Information

摘要

Rough sets are applied to data tables containing possibilis-tic information. A family of weighted equivalence classes is obtained, in which each equivalence class is accompanied by a possibilistic degree to which it is an actual one. By using the family of weighted equivalence classes we can derive a lower approximation and an upper approximation. The lower approximation and the upper approximation coincide with those obtained from methods of possible worlds. Therefore, the method of weighted equivalence classes is justified.