An Incremental Alogrithm for Inducing Decision Trees and Its Complexity

YIN Adong; GONG Yu; WU Shengli; WU Sen; GAO Xuedong; LI Yongjun

doi:10.13374/j.issn1001-053x.2004.02.022

Volume 26 Issue 2

Aug. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 2004 > 26(2): 202-205

YIN Adong, GONG Yu, WU Shengli, WU Sen, GAO Xuedong, LI Yongjun. An Incremental Alogrithm for Inducing Decision Trees and Its Complexity[J]. Chinese Journal of Engineering, 2004, 26(2): 202-205. doi: 10.13374/j.issn1001-053x.2004.02.022

Citation:

YIN Adong, GONG Yu, WU Shengli, WU Sen, GAO Xuedong, LI Yongjun. An Incremental Alogrithm for Inducing Decision Trees and Its Complexity[J]. Chinese Journal of Engineering, 2004, 26(2): 202-205. doi: 10.13374/j.issn1001-053x.2004.02.022

Citation:

PDF( 433 KB)

An Incremental Alogrithm for Inducing Decision Trees and Its Complexity

doi: 10.13374/j.issn1001-053x.2004.02.022

Management School, University of Science and Technology Beijing, Beijing 100083, China

Received Date: 2002-06-10
Available Online: 2021-08-16

Abstract

Abstract

An incremental algorithm for inducing decision trees is presented based on ID3 algorithm. The complexity of the incremental algorithm is analyzed in terms of instance-count additions and e-score calculations. The same training instance shows that the incremental algorithm can induce decision trees equivalent to those forms by ID3 algorithm.
- decision trees,
- incremental algorithm,
- complexity