Research of Data Reduction Based on Binary Trees
Gang Wang
Abstract
Gang Wang
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Reduction (mathematics), Data reduction, Rough set, Binary number, Computer science, Set (abstract data type), Data mining, Data set