2009 IEEE International Conference on
Systems, Man, and Cybernetics |
![]() |
Abstract
Dominance-based Rough Set Approach (DRSA) introduced by Greco et al. is a useful tool for multi-criteria data analysis problems. Recently, Dembczynski et al. introduced the concept of generalized decisions as a generalization of original DRSA where criteria in a decision table may be assigned a range of values. In this paper, we use indexed blocks as granules for computing approximations of generalized decisions. Each generalized decision table is represented by a pair of lower and upper singleton decision tables. A generalized decision table is definable if both its lower and upper singleton decision tables are definable. In addition, we introduce two simple algorithms based on minimum and maximum operations for making a decision table definable. The proposed approach is demonstrated by examples.