Attribute reduction in decision-theoretic rough set models

作者：Yao Yiyu; Zhao Yan^*

来源：Information Sciences, 2008, 178(17): 3356-3373.

DOI：10.1016/j.ins.2008.05.010

• attribute reduction
• decision-theoretic rough set model
• Pawlak rough set model

Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, leading to different decisions and consequences. They can be distinguished not only from the syntax measures such as confidence, coverage and generality, but also the semantic measures such as decision-monotocity, cost and risk. The classification rules can be evaluated locally for each individual rule, or globally for a set of rules. Both the two types of classification rules can be generated from, and interpreted by, a decision-theoretic model, which is a probabilistic extension of the Pawlak rough set model.
As an important concept of rough set theory, an attribute reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of the given information table. This paper addresses attribute reduction in decision-theoretic rough set models regarding different classification properties, such as: decision-monotocity, confidence, coverage, generality and cost. It is important to note that many of these properties can be truthfully reflected by a single measure gamma in the Pawlak rough set model. On the other hand, they need to be considered separately in probabilistic models. A straightforward extension of the gamma measure is unable to evaluate these properties. This study provides a new insight into the problem of attribute reduction.

• 出版日期2008-9-1