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

基于布尔函数的Rough集差别矩阵属性约简方法
引用本文:王光明,魏长华.基于布尔函数的Rough集差别矩阵属性约简方法[J].计算机工程与应用,2005,41(11):160-162,176.
作者姓名:王光明  魏长华
作者单位:华中师范大学计算机科学系,武汉,430079
摘    要:Rough集理论是对大型数据库进行知识发现的主要方法之一。根据属性集核和相对等价类的概念,对数据库属性集中的属性进行约简,提取相应的规则(知识),是用Rough集知识发现的精髓。该文基于Rough集差别矩阵,提出了属性集的布尔函数的构造方法,并应用吸收律、分配律和等幂律对属性集布尔函数化简。论文证明了属性集布尔函数的化简与属性集的差别矩阵约简等价,同时给出了求相对决策属性基本集的算法和IRIS提供的数据仿真实验结果。

关 键 词:Rough集理论  差别矩阵  布尔函数  知识发现
文章编号:1002-8331-(2005)11-0160-03

Reduction of Attributes Discernibility Matrix in Rough Set Theory Based on Boolean Function
Wang Guangming,Wei Changhua.Reduction of Attributes Discernibility Matrix in Rough Set Theory Based on Boolean Function[J].Computer Engineering and Applications,2005,41(11):160-162,176.
Authors:Wang Guangming  Wei Changhua
Abstract:Attributes reduction of discernibility matrix is a core step of knowledge discovery using Rough set theory.This paper addresses construction method of Boolean function in discernibility matrix.And absorption law,distribution law and exponentiation law are applied to simplify for Boolean expression.To simplify Boolean function is equivalence to reduction of attributes discernibility matrix.Algorithm steps and simulation result of based set relative to decision attribute are presented according to IRIS data set in this paper.
Keywords:Rough set theory  discernibility matrix  Boolean function  knowledge discovery in database
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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