Probabilistic Rough Sets

SPRINGER HANDBOOK OF COMPUTATIONAL INTELLIGENCE(2015)

引用 44|浏览14
暂无评分
摘要
As quantitative generalizations of Pawlak rough sets, probabilistic rough sets consider degrees of overlap between equivalence classes and the set. An equivalence class is put into the lower approximation if the conditional probability of the set, given the equivalence class, is equal to or above one threshold; an equivalence class is put into the upper approximation if the conditional probability is above another threshold hold. We review a basic model of probabilistic rough sets (i.e., decision-theoretic rough set model) and variations. We present the main results of probabilistic rough sets by focusing on three issues: (a) interpretation and calculation of the required thresholds, (b) estimation of the required conditional probabilities, and (c) interpretation and applications of probabilistic rough set approximations.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要