Research of Decision Tree Classification Algorithm in Data Mining

Decision tree algorithm is one of the most important classification measures in data mining. Decision tree classifier as one type of classifier is a flowchart like tree structure, where each intenal node denotes a test on an attribute, each branch represents an outcome of the test, and each leaf node represents a class. The method that a decision tree model is used to classify a record is to find a path that from root to leaf by measuring the attributes test, and the attribute on the leaf is classification result.

[1]  Hussein A. Abbass,et al.  Classification rule discovery with ant colony optimization , 2003, IEEE/WIC International Conference on Intelligent Agent Technology, 2003. IAT 2003..

[2]  Hong Sun,et al.  A Supervised Classification Method Based on Conditional Random Fields With Multiscale Region Connection Calculus Model for SAR Image , 2011, IEEE Geoscience and Remote Sensing Letters.

[3]  Wil M. P. van der Aalst,et al.  Exterminating the Dynamic Change Bug: A Concrete Approach to Support Workflow Change , 2001, Inf. Syst. Frontiers.

[4]  Ian Witten,et al.  Data Mining , 2000 .

[5]  Alex Alves Freitas,et al.  Data mining with an ant colony optimization algorithm , 2002, IEEE Trans. Evol. Comput..

[6]  Mehmed Kantardzic,et al.  Data-Mining Concepts , 2011 .

[7]  Philip S. Yu,et al.  Top 10 algorithms in data mining , 2007, Knowledge and Information Systems.