计算机与现代化 ›› 2013, Vol. 1 ›› Issue (7): 56-058.doi: 10.3969/j.issn.1006-2475.2013.07.014

• 算法设计与分析 • 上一篇    下一篇

基于Pawlak的决策粗糙集的属性约简研究

韩丽丽,李龙澍   

  1. 安徽大学计算机科学与技术学院,安徽合肥230601
  • 收稿日期:2013-02-27 修回日期:1900-01-01 出版日期:2013-07-17 发布日期:2013-07-17

Researh on Attribute Reduction of Decision-theoretic Rough Set Model Based on Pawlak

HAN Li-li, LI Long-shu   

  1. School of Computer Science and Technology, Anhui University, Hefei 230601, China
  • Received:2013-02-27 Revised:1900-01-01 Online:2013-07-17 Published:2013-07-17

摘要: 粗糙集用于规则归纳时,其正域规则和边界规则这两种不同的分类规则会导致不同的决策序列。这两种分类规则都能够从语法和语义上进行区分,并被Pawlak模型所延伸的粗糙集理论所解释。属性约简是粗糙集理论的一个重要概念,本文针对决策粗糙集中的决策单调性这个分类属性,给出属性约简中基于正域约简模型及其分析。

关键词: 决策粗糙集, 属性约简, 损失函数

Abstract: Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, which leading to different decisions and consequences. They can be distinguished from the syntax measures and semantic measures. Both the two can be interpreted by a probabilistic extension of the Pawlak rough set model. Attribute reduction is an important concept of rough set theory. This paper addresses attribute reduction in decision-theoretic rough set models regarding the classification properties of decision-monotonicity and provides a positive-based Veduction model in attribute reduction and its analysis.

Key words: decision-theoretic rough set, attribute reduction, loss function