|
|||||
|
|
| 基于二进制有序差别集的属性约简算法 | |
| 引用本文： | 葛浩,杨传健,李龙澍. 基于二进制有序差别集的属性约简算法[J]. 计算机应用与软件, 2009, 26(8): 69-72 |
| 作者姓名： | 葛浩 杨传健 李龙澍 |
| 作者单位： | 1. 滁州学院电子信息工程系,安徽,滁州,239012 2. 滁州学院计算机系,安徽,滁州,239012 3. 安徽大学计算机学院,安徽,合肥,230039 |
| 基金项目： | 安徽省自然科学基金项目，安徽高校省级自然科学研究项目 |
| 摘 要： | 文献[6]给出的基于简化二进制可分辨矩阵的快速属性约简算法是不完备的,并且在处理大数据集时的效率不很理想.提出一种基于二进制有序差别集的属性约简算法,该算法不需要创建二进制可分辨矩阵,减少了数据处理量,大大提高了约简的效率,使算法的时间复杂度和空间复杂度分别降为max{O(|C|2|U/C|2),O(|C|2|BMsCount|)}和O(|BMsCount |).最后的实验结果表明该算法是正确的、高效的. |
| 关 键 词： | 粗糙集 二进制可分辨矩阵 有序差别集 核属性 属性频率 |
AN ATTRIBUTE REDUCTION ALGORITHM BASED ON BINARY ORDERED DISCERNIBILITY SET |
|
| Ge Hao,Yang Chuanjian,Li Longshu. AN ATTRIBUTE REDUCTION ALGORITHM BASED ON BINARY ORDERED DISCERNIBILITY SET[J]. Computer Applications and Software, 2009, 26(8): 69-72 | |
| Authors: | Ge Hao Yang Chuanjian Li Longshu |
| Affiliation: | Department of Electronic and Information Engineering;Chuzhou Institute;Chuzhou 239012;Anhui;China;Department of Computer Science;China;School of Computer Science;Anhui University;Hefei 230039;China |
| Abstract: | Fast attributes reduction algorithm provided by Xu Yanzhang based on simplified binary discernibility matrix is an incomplete one,and is far from efficiency in dealing with large data sets.In the paper,an attribute reduction algorithm based on binary ordered discernibility set is presented.The algorithm does not need to create a binary discernibility matrix,and the computing data is decreased greatly,thus the efficiency of the reduction algorithm is noticeably improved.The time complexity and space complexi... |
| Keywords: | Rough set Binary discernibility matrix Ordered discernibility set Core attributes Attributes frequency |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |