Data-driven decision tree learning algorithm based on rough set theory
Desheng Yin, Guoyin Wang, Yu Wu
Abstract
Desheng Yin, Guoyin Wang, Yu Wu
Abstract
Decision tree pre-pruning is an effective method to solve the over-fitting problem in decision tree learning process. However, it is difficult to estimate the exact time to stop the growing process of a decision tree, which limits the developments and applications of this method. In this paper, the growing of a decision tree is controlled by the uncertainty of a decision table, and a data-driven learning algorithm for decision tree pre-pruning is developed.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
Decision tree pre-pruning is an effective method to solve the over-fitting problem in decision tree learning process. However, it is difficult to estimate the exact time to stop the growing process of a decision tree, which limits the developments and applications of this method. In this paper, the growing of a decision tree is controlled by the uncertainty of a decision table, and a data-driven learning algorithm for decision tree pre-pruning is developed.
Key concepts: Incremental decision tree, ID3 algorithm, Decision tree, Pruning, Decision tree learning, Computer science, Decision stump, Decision table