节点文献
基于布尔函数的Rough集差别矩阵属性约简方法
Reduction of Attributes Discernibility Matrix in Rough Set Theory Based on Boolean Function
【摘要】 Rough集理论是对大型数据库进行知识发现的主要方法之一。根据属性集核和相对等价类的概念,对数据库属性集中的属性进行约简,提取相应的规则(知识),是用Rough集知识发现的精髓。该文基于Rough集差别矩阵,提出了属性集的布尔函数的构造方法,并应用吸收律、分配律和等幂律对属性集布尔函数化简。论文证明了属性集布尔函数的化简与属性集的差别矩阵约简等价,同时给出了求相对决策属性基本集的算法和IRIS提供的数据仿真实验结果。
【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.
【Key words】 Rough set theory; discernibility matrix; Boolean function; knowledge discovery in database;
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2005年11期
- 【分类号】TP18
- 【被引频次】9
- 【下载频次】128