J4

• 计算机科学 • 上一篇    下一篇

基于粗糙集的识别矩阵值简式求取算法DMBVR

刘亚波1,2, 胡陈勇1, 刘大有1,2   

  1. 1. 吉林大学计算机科学与技术学院, 长春 130012;2. 吉林大学符号计算与知识工程教育部重点实验室, 长春 130012
  • 收稿日期:2003-10-27 修回日期:1900-01-01 出版日期:2004-04-26 发布日期:2004-04-26
  • 通讯作者: 刘大有

Value reduction algorithm DMBVR based onthe discernible matrix of Rough set

LIU Ya-bo1,2, HU Chen-yong1, LIU Da-you1,2   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education,Jilin University, Changchun 130012, China
  • Received:2003-10-27 Revised:1900-01-01 Online:2004-04-26 Published:2004-04-26
  • Contact: LIU Da-you

摘要: 针对粗糙集所采用化简决策表的方法中存在着求取属性约简和值简式时重复计算的问题进行了改进. 提出基于识别矩阵得到决策规则值核的方法, 进一步给出基于识别矩阵求取决策规则值简式的算法DMBVR, 并证明DMBVR算法能得到决策表中所有决策规则的值简式, 从而使计算决策规则的值核与值简式的过程变得更加简便、 直观.

关键词: 粗糙集理论, 识别矩阵, 值核, 值简式

Abstract: The problem in the usual reduction method of a decision table by means of Rough set theory is that it does not make full use of the information given by discernible matrix so that it gives rise to the repeated computation in computing the core value and the value reduction of the decision rules. The present paper aims at improving the present value reduction strategy used widely, which can get the core values of each rule from the discernible matrix. Then the DMBVR algorithm is given, which can get all the value reductions based on the discernible matrix. Finally it is proved that DMBVR algorithm can get all the reductions of each rule and makes the process of computing the core value and the value reduction more simple.

Key words: Rough set, discernible matrix, core value, value reduction

中图分类号: 

  • TP18