DocumentCode :
2754962
Title :
The Relationship between Decision Trees and the Scale of Train Data Set
Author :
Chen, Ning ; Zhu, Meilin ; Jiang, Yong ; Chen, An
Author_Institution :
Inst. of Mech., Chinese Acad. of Sci., Beijing
Volume :
2
fYear :
0
fDate :
0-0 0
Firstpage :
6087
Lastpage :
6091
Abstract :
Decision trees need train samples in the train data set to get classification rules. If the number of train data was too small, the important information might be missed and thus the model could not explain the classification rules of data. While it is not affirmative that large scale of train data set can get well model. This paper analysis the relationship between decision trees and the train data scale. We use nine decision tree algorithms to experiment the accuracy, complexity and robustness of decision tree algorithms. Some results are demonstrated
Keywords :
computational complexity; decision trees; learning (artificial intelligence); pattern classification; data classification rules; data set training; decision trees; Aerospace engineering; Aerospace industry; Automatic testing; Classification tree analysis; Data engineering; Decision trees; Electronic mail; Engineering management; Industrial training; Management training; accuracy; complexity; decision tree; train data;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on
Conference_Location :
Dalian
Print_ISBN :
1-4244-0332-4
Type :
conf
DOI :
10.1109/WCICA.2006.1714250
Filename :
1714250
Link To Document :
بازگشت