首页 | 本学科首页   官方微博 | 高级检索  
     

基于二进制可辨矩阵的决策规则约简算法
引用本文:王锡淮,张腾飞,肖健梅.基于二进制可辨矩阵的决策规则约简算法[J].计算机工程与应用,2007,43(27):178-180.
作者姓名:王锡淮  张腾飞  肖健梅
作者单位:上海海事大学电气自动化系,上海200135
基金项目:上海市重点学科建设项目 , 上海市教委资助项目
摘    要:决策规则的约简是利用决策逻辑分别消去每一条决策规则中的冗余属性值,是粗糙集理论知识约简的重要内容,一般是在属性约简之后采用启发式信息实现决策规则的约简。基于二进制可辨矩阵给出一个简单的直接求取决策规则核的方法,并提出一种决策规则的约简算法。所给算法简单直观,不但适用于相容决策表,也适用于不相容的决策表。

关 键 词:粗糙集  二进制可辨矩阵  属性约简  决策规则约简  决策表
文章编号:1002-8331(2007)27-0178-03
修稿时间:2007-01-01

Algorithm for decision rules reduction based on binary discernibility matrix
WANG Xi-huai,ZHANG Teng-fei,XIAO Jian-mei.Algorithm for decision rules reduction based on binary discernibility matrix[J].Computer Engineering and Applications,2007,43(27):178-180.
Authors:WANG Xi-huai  ZHANG Teng-fei  XIAO Jian-mei
Affiliation:Department of Electrical and Automation,Shanghai Maritime University,Shanghai 200135,China
Abstract:The decision roles reduction,namely deleting the redundant attribute values of each rule in decision table,is an important topic in the research on data reduction based on rough set theory.It can be achieved by heuristic information after attribute reduction.A method for calculating decision rules core based on binary discernibility matrix is presented directly.And then, an algorithm for decision rules reduction is designed,which is suitable for not only consistent decision table but also inconsistent decision table.
Keywords:rough set theory  binary discernibility matrix  attribute reduction  decision rules reduction  decision table
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号