|
|||||
|
|
| 基于属性布尔差别矩阵的求核算法 | |
| 引用本文： | 葛浩,李龙澍,杨传健.基于属性布尔差别矩阵的求核算法[J].小型微型计算机系统,2012,33(2):275-279. |
| 作者姓名： | 葛浩 李龙澍 杨传健 |
| 作者单位： | 1. 滁州学院电子信息工程系,安徽滁州,239012 2. 安徽大学计算机学院,合肥,230039 3. 滁州学院计算机系,安徽滁州,239012 |
| 基金项目： | 安徽省自然科学基金，安徽高校省级自然科学研究项目，安徽省高等学校省级优秀青年人才基金，滁州学院科学研究项目 |
| 摘 要： | 求核是粗糙集理论的主要研究内容之一.针对现有基于差别矩阵求核算法的不足,首先提出决策表简化的方法；然后,给出属性布尔差别矩阵的定义和基于属性布尔差别矩阵的核属性定义,并证明了该定义与基于正区域求核定义是等价的,同时设计相应求核算法；为了进一步提高求核效率和适应大数据集的处理,给出两个改进的求核算法.通过实例分析和实验比较,表明了本文所提出的求核算法是正确的高效的. |
| 关 键 词： | 粗糙集 正区域 布尔差别矩阵 核属性 |
Algorithm for Computing Core Based on Attribute Boolean Discerniblity Matrix |
|
| GE Hao , LI Long-shu , YANG Chuan-jian.Algorithm for Computing Core Based on Attribute Boolean Discerniblity Matrix[J].Mini-micro Systems,2012,33(2):275-279. | |
| Authors: | GE Hao LI Long-shu YANG Chuan-jian |
| Affiliation: | 1(Department of Electronic and Information Engineering,Chuzhou University,Chuzhou 239012,China) 2(School of Computer Science and Technology,Anhui University,Hefei 230039,China) 3(Department of Computer Science,Chuzhou University,Chuzhou 239012,China) |
| Abstract: | The computation of core is one of the most important problems of rough set theory.To overcome the shortcomings of computing core attributes based on discerniblity matrix,firstly,the methods of simplifying decision table is proposed.And then,the definition of attribute boolean discerniblity matrix and the corresponding definition of computing core are present.It is proved that the definition of core attribute is equitant with the one based on positive region.In order to improve the efficiency of computing core algorithms and adapt to deal with huge data sets,two improved algorithms are put forward.Finally,both of the example analysis and experiment results show that the computing core algorithms proposed are correct and efficient. |
| Keywords: | rough set positive region boolean discerniblity matrix core attribute |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |