Notice of Retraction Review of decision trees

The decision tree algorithm is a hot point in the field of data mining, which is usually used to form classifiers and prediction models. In practice, it has a wide application. This paper describes the decision tree technology and its development process, focuses on typical decision tree algorithms, analyzes their advantages and disadvantages, compares several algorithms, and finally discusses the development of the decision tree algorithm in the future.

[1]  William Frawley,et al.  Knowledge Discovery in Databases , 1991 .

[2]  Jorma Rissanen,et al.  SLIQ: A Fast Scalable Classifier for Data Mining , 1996, EDBT.

[3]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.

[4]  Rakesh Agrawal,et al.  SPRINT: A Scalable Parallel Classifier for Data Mining , 1996, VLDB.

[5]  Wei-Yin Loh,et al.  Classification and regression trees , 2011, WIREs Data Mining Knowl. Discov..

[6]  Gregory Piatetsky-Shapiro,et al.  Knowledge Discovery in Databases: An Overview , 1992, AI Mag..

[7]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[8]  MU Xiang-wei,et al.  Research on Decision Tree Classification Algorithms , 2011 .