Probabilistic approaches to rough sets (2003)
| Venue: | Expert Systems |
| Citations: | 10 - 3 self |
BibTeX
@ARTICLE{Yao03probabilisticapproaches,
author = {Y. Y. Yao},
title = {Probabilistic approaches to rough sets},
journal = {Expert Systems},
year = {2003},
volume = {20},
pages = {287--297}
}
Years of Citing Articles
OpenURL
Abstract
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a universe. Both algebraic and probabilistic rough set approximations are studied. The probabilistic approximations are defined in a decision-theoretic framework. The problem of rule induction, a major application of rough set theory, is studied in probabilistic and information-theoretic terms. Two types of rules are analyzed, the local, low order rules, and the global, high order rules. 1







