| 基于二叉树结构的数据约简算法研究 |
| |
| 引用本文： | 王刚,王浩. 基于二叉树结构的数据约简算法研究[J]. 四川理工学院学报(自然科学版), 2007, 20(4): 43-45 |
| |
| 作者姓名： | 王刚 王浩 |
| |
| 作者单位： | 合肥工业大学计算机与信息学院,合肥,230009;铜陵学院计算机系,安徽,铜陵,244000;合肥工业大学计算机与信息学院,合肥,230009 |
| |
| 摘 要： | 在粗糙集理论中,数据约简是一个非常重要的研究课题,它包括属性约简与属性值约简。现己证明寻找一个信息系统的最优约简是NP-难题。文章主要研究了基于二叉树结构的数据约简方法,实验结果表明,该算法在大多数情况下能够有效地获得信息系统的一个最优约简。
|
| 关 键 词： | 粗糙集理论 分辨矩阵 二叉树 数据约简 |
| 文章编号： | 1673-1549（2007）04-00043-03 |
| 收稿时间： | 2007-03-01 |
| 修稿时间： | 2007-03-01 |
Research of Data Reduction Based on Binary Trees |
| |
| WANG Gang,WANG Hao. Research of Data Reduction Based on Binary Trees[J]. Journal of Sichuan University of Science & Engineering(Natural Science Editton), 2007, 20(4): 43-45 |
| |
| Authors: | WANG Gang WANG Hao |
| |
| Affiliation: | 1. Computer and Information College, Hefei Technology University, Hefei 230009, China; 2. Department of Computer Science, Tongling College, Tongling 244000, China |
| |
| Abstract: | In rough set theory,data reduction is a very important issue,it includes attributes and attribute values reduction.Others are looking for a proven information system of the best reduction is a NP-problem.This paper mainly based on the study of a binary tree data reduction method ,experimental results show that the algorithm in most cases be able to effectively obtain information system of an optimal reduction. |
| |
| Keywords: | rough sets discernable matrix binary trees data reduction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
