.png){kind=icon}
返回
Decision-theoretic rough set: A multicost strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2015.09.011.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
By introducing the misclassification and delayed decision costs into the probabilistic approximations of the target, the model of decision-theoretic rough set is then sensitive to cost. However, traditional decision-theoretic rough set is proposed based on one and only one cost matrix, such model does not take the characteristics of multiplicity and variability of cost into consideration. To fill this gap, a multicost strategy is developed for decision-theoretic rough set. Firstly, from the viewpoint of the voting fusion mechanism, a parameterized decision-theoretic rough set is proposed. Secondly, based on the new model, the smallest possible cost and the largest possible cost are calculated in decision systems. Finally, both the decision-monotocity and cost criteria are introduced into the attribute reductions. The heuristic algorithm is used to compute decision-monotonicity reduct while the genetic algorithm is used to compute the smallest and the largest possible cost reducts. Experimental results on eight UCI data sets tell us: I. compared with the raw data, decision-monotocity reduct can generate greater lower approximations and more decision rules; 2. the smallest possible cost reduct is much better than decision-monotocity reduct for obtaining smaller costs and more decision rules. This study suggests new research trends concerning decision-theoretic rough set theory. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Cost reduct
Decision-monotocity reduct
Decision-theoretic rough set
Multiple cost matrices
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
Incremental updating approximations in probabilistic rough sets under the variation of attributes属性变化下概率粗糙集中的增量更新逼近
PREAI
分享收藏
查看更多内容