基于二叉树结构的数据约简算法研究

Research of Data Reduction Based on Binary Trees

在粗糙集理论中,数据约简是一个非常重要的研究课题,它包括属性约简与属性值约简。现己证明寻找一个信息系统的最优约简是NP-难题。文章主要研究了基于二叉树结构的数据约简方法,实验结果表明,该算法在大多数情况下能够有效地获得信息系统的一个最优约简。

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.