DocumentCode :
2288012
Title :
A New Structuring Method of Decision Tree
Author :
Linzhang, Xu ; Qiang, Zhao ; Yanning, Zhang
Author_Institution :
Sch. of Comput. Sci. & Eng., Northwestern Polytech. Univ., Xi´´an
fYear :
2008
fDate :
20-22 Dec. 2008
Firstpage :
817
Lastpage :
820
Abstract :
Decision tree is a common classification algorithm, but this classic algorithm shows low efficiency when dealing with massive data structure decision tree. This paper presents a new approach to structuring decision tree. The split calculation of training units in classic algorithm is taken the place by FP Tree path sets. This method can improve the efficiency of decision tree with the presupposition that the results are the same with the classic algorithm. This method has been testified its validity and superiority by experiments.
Keywords :
data structures; decision trees; FP tree path sets; classification algorithm; data structure; decision tree; Classification algorithms; Classification tree analysis; Computer science; Costs; Data engineering; Databases; Decision trees; Prediction methods; Testing; Tree data structures; Classification; Decision Tree; FP_Tree;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Electrical Engineering, 2008. ICCEE 2008. International Conference on
Conference_Location :
Phuket
Print_ISBN :
978-0-7695-3504-3
Type :
conf
DOI :
10.1109/ICCEE.2008.50
Filename :
4741097
Link To Document :
بازگشت