|
|||||
|
|
| 基于二进制可分辨矩阵的快速求核算法 | |
| 引用本文： | 葛浩,杨传健,李龙澍.基于二进制可分辨矩阵的快速求核算法[J].计算机工程与应用,2009,45(7):164-166. |
| 作者姓名： | 葛浩 杨传健 李龙澍 |
| 作者单位： | 1. 滁州学院电子信息工程系,安徽,滁州,239012;安徽大学计算机学院,合肥,230039 2. 滁州学院计算机系,安徽,滁州,239012 3. 安徽大学计算机学院,合肥,230039 |
| 基金项目： | 安徽省自然科学基金，安徽高校省级自然科学研究项目 |
| 摘 要： | 目前,求核算法存在以下不足:求得的核与正区域的核不一致,求核算法的时间复杂度和空间复杂度不理想。针对上述问题,给出一种二进制可分辨矩阵的定义及其求核性质,并证明了由该性质获得的核与正区域的核是等价的,然后设计求核算法,该算法的时间复杂度为max{O(|C||U/C|~2),O(|C||U|)},空间复杂度为O(|C||U/C|~2)。最后实例说明该方法的可行性和有效性。 |
| 关 键 词： | 粗糙集 等价类 可分辨矩阵 核 |
| 收稿时间： | 2008-1-21 |
| 修稿时间： | 2008-4-14 |
Quick computing core algorithm based on binary discernibility matrix |
|
| GE Hao,YANG Chuan-jian,LI Long-shu.Quick computing core algorithm based on binary discernibility matrix[J].Computer Engineering and Applications,2009,45(7):164-166. | |
| Authors: | GE Hao YANG Chuan-jian LI Long-shu |
| Affiliation: | GE Hao,YANG Chuan-jian,LI Long-shu 1.Department of Electronic , Information Engineering,Chuzhou University,Chuzhou,Anhui 239012,China 2.Department of Computer Science,China 3.School of Computer Science,Anhui University,Hefei 230039,China |
| Abstract: | At present,the algorithms of the computing core have the following shortcomings:the core acquired from these algorithms is not the core based on positive region,the time complexity and space complexity are not good.Aiming at these problems,a binary discernibility matrix and correspondence property of computing core are provided.It is proved that the core acquired from the property is equivalent to the core based on positive region.Then,the computing core algorithm is designed,its time complexity is max{O(|C... |
| Keywords: | rough set equivalence class dicernibility matrix core |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 | |
| 点击此处可从《计算机工程与应用》下载全文 | |
