| Abstract: | Covering rough sets are improvements of traditional rough sets by considering cover of universe instead of partition. In this paper, we develop several measures based on evidence theory to characterize covering rough sets. First, we present belief and plausibility functions in covering information systems and study their properties. With these measures we characterize lower and upper approximation operators and attribute reductions in covering information systems and decision systems respectively. With these discussions we propose a basic framework of numerical characterizations of covering rough sets. |
