DocumentCode :
1717464
Title :
Research on the missing attribute value data-oriented for decision tree
Author :
Yun-fei, Qiu ; Xin-yan, Zhang ; Xue, Li ; Liang-shan, Shao
Author_Institution :
Coll. of Software Eng., Liaoning Tech. Univ., Huludao, China
Volume :
2
fYear :
2010
Abstract :
In the existing multiple choice methods of decision tree´ test attributes, can´t see such report as” Let missing data processing integrated in the selection process of test attributes”, however, the existing process methods of missing attribute value data can draw into bias in different degrees, base on this, propose an information gain rate base on combination entropy as the decision tree´s testing attributes selection criteria, which can eliminate missing value arrtibutes´ infulence on testing attributes selection, and be implemented on WEKA. The computational complexity of the MultiInfo Tree is better than that of C4.5.
Keywords :
computational complexity; data handling; tree data structures; computational complexity; data processing; decision tree; information gain rate; missing attribute value data oriented; Annealing; Classification algorithms; Classification tree analysis; Entropy; Information systems; Signal processing algorithms; combination entropy; decision tree; missing attribute value data;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing Systems (ICSPS), 2010 2nd International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-1-4244-6892-8
Electronic_ISBN :
978-1-4244-6893-5
Type :
conf
DOI :
10.1109/ICSPS.2010.5555604
Filename :
5555604
Link To Document :
بازگشت