Attribute reduction in decision-theoretic rough set models

  • Authors:
  • Yiyu Yao;Yan Zhao

  • Affiliations:
  • Department of Computer Science, University of Regina, 3737 Wascana Parkway, Regina, Saskatchewan, Canada S4S 0A2;Department of Computer Science, University of Regina, 3737 Wascana Parkway, Regina, Saskatchewan, Canada S4S 0A2

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.08

Visualization

Abstract

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 @c in the Pawlak rough set model. On the other hand, they need to be considered separately in probabilistic models. A straightforward extension of the @c measure is unable to evaluate these properties. This study provides a new insight into the problem of attribute reduction.