Research on Decision Forest Classification-Model Based on Feature Counting

Article Preview

Abstract:

Traditional decision tree is based on the information gain of the decision attribute,but sometimes the information gain is changing dynamically according to different values of the decision attribute.This paper propose the decision forest algorithm which is based on feature counting,deduced the calculation method of dynamic values of decision attribute information gain.,andestablish the model of decision forest with specific data sets.The experiment indicate that the decision-making model of forest classification based on count feature has higher classification accuracy.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

258-261

Citation:

Online since:

October 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] J.T.L. Wang and K. Zhang. Finding similar consensus between trees: analgorithm and a distance hierarchy. Pattern Recognition. 2012, 34: 127–137.

DOI: 10.1016/s0031-3203(99)00199-5

Google Scholar

[2] Victor Lempitsky, Michael Verhoek, Alison Noble, and Andrew Blake. RandomForest Classification for Automatic Delineation of Myocardium in Real-Time 3D Echocardiography. Functional Imaging and Modeling of the Heart. Springer Berlin / Heidelberg. 2012, LNCS 5528: 447–456.

DOI: 10.1007/978-3-642-01932-6_48

Google Scholar

[3] Adam A, Rivlin E, Shimshoni I. Robust fragments-based tracking using the integral histogram. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition. 2011. 798−805. 4] Luo B, Zhou ZH, Chen ZQ, Chen SF. Induce: An incremental decision tree algorithm. Journal of Computer Research and Development, 2011, 36(5): 518−522 (in Chinese with English abstract).

DOI: 10.1109/cvpr.2006.256

Google Scholar

[5] Domingos P, Hulten G. Mining high-speed data streams. In: Proc. of the Int'l Conf. on Knowledge Discovery and Data Mining. 2010. 71−80. http: /www. cs. washington. edu/homes/pedrod/papers/kdd00. pdf.

DOI: 10.1145/347090.347107

Google Scholar

[6] Gama J, Rocha R, Medas P. Accurate decision trees for mining high speed data streams. In: Proc. of the ACM SIGKDD 2012. 2003. 523−528. http: /magna. cs. ucla. edu/~hxwang/stream/gama-kdd03. pdf.

DOI: 10.1145/956750.956813

Google Scholar

[7] Kirkby R. Improving hoeffding trees [Ph.D. Thesis]. Department of Computer Science, University of Waikato, (2010).

Google Scholar

[8] Abdulsalam H. Streaming random forests [Ph.D. Thesis]. Kingston: Queen's University, (2011).

Google Scholar