The rough sets theory and evidence theory
Fundamenta Informaticae
From rough set theory to evidence theory
Advances in the Dempster-Shafer theory of evidence
Data mining using extensions of the rough set model
Journal of the American Society for Information Science - Special issue: knowledge discovery and data mining
Interpretations of belief functions in the theory of rough sets
Information Sciences: an International Journal - From rough sets to soft computing
Relational interpretations of neighborhood operators and rough set approximation operators
Information Sciences—Informatics and Computer Science: An International Journal
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
A New Qualitative Rough-Set Approach to Modeling Belief Functions
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Attribute reduction based on evidence theory in incomplete decision systems
Information Sciences: an International Journal
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
Information Sciences: an International Journal
Algebraic approach to generalized rough sets
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Some mathematical structures of generalized rough sets in infinite universes of discourse
Transactions on rough sets XIII
| Hi-index | 0.00 |
A general type of belief structure and its inducing dual pair of belief and plausibility functions on infinite universes of discourse are first defined. Relationship between belief and plausibility functions in Dempser-Shafer theory of evidence and the lower and upper approximations in rough set theory is then established. It is shown that the probabilities of lower and upper approximations induced by an approximation space yield a dual pair of belief and plausibility functions. And for any belief structure there must exist a probability approximation space such that the belief and plausibility functions defined by the given belief structure are just respectively the lower and upper probabilities induced by the approximation space. Finally, essential properties of the belief and plausibility functions are examined. The belief and plausibility functions are respective a monotone Choquet capacity and an alternating Choquet capacity of infinite order.