Approximate Optimal Decision Tree Generation Algorithm Based On Rough Set

Data mining is an important data analysis method,and decision tree is one of main techniques in data mining.A problem concerned by many researches is how to construct a decision tree.In this paper,based on rough set,an attribute and attribute value reduc-tion can be used to delete redundant decision information in a decision table.On the basis of compact information an approximate optimal decision tree is built.An Algorithm to generate decision tree is proposed in this paper,and it is illustrated by using a real example.