DocumentCode
3239448
Title
ID3 optimization algorithm based on interestingness gain
Author
Zhongtao, Liu ; Hong, Wang
Author_Institution
Dept. of Comput. Sci., Henan Univ. of Econ. & Law, Zhengzhou, China
fYear
2011
fDate
27-29 May 2011
Firstpage
73
Lastpage
77
Abstract
Aimed at the backwards of the information gain in ID3, through the improvement of information gain on interests of the users, and based on the calculating specialties of information gain in ID 3, the article reduces the backwards of decision tree´s attribute dependency towards more value by decision tree optimization through twice information gain and optimized calculation. The experiment proves that: compared with the traditional method, the optimized ID3 is provided with high accuracy and counting speed. In addition the structure decision tree possesses the advantage of lower average of leaf tree.
Keywords
data analysis; data mining; decision trees; optimisation; ID3 optimization algorithm; counting speed; data classification; data mining; decision tree optimization; information gain; interestingness gain; leaf tree; structure decision tree; Classification algorithms; Decision trees; Rain; ID3 algorithm (key words); data mining; decision tree;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on
Conference_Location
Xi´an
Print_ISBN
978-1-61284-485-5
Type
conf
DOI
10.1109/ICCSN.2011.6014678
Filename
6014678
Link To Document