尹阿东, 宫雨, 吴胜利, 武森, 高学东, 李拥军. 增量决策树算法及复杂度分析[J]. 工程科学学报, 2004, 26(2): 202-205. DOI: 10.13374/j.issn1001-053x.2004.02.022
引用本文: 尹阿东, 宫雨, 吴胜利, 武森, 高学东, 李拥军. 增量决策树算法及复杂度分析[J]. 工程科学学报, 2004, 26(2): 202-205. DOI: 10.13374/j.issn1001-053x.2004.02.022
shu
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
shu

增量决策树算法及复杂度分析

An Incremental Alogrithm for Inducing Decision Trees and Its Complexity

    摘要
  • 摘要: 介绍了增量决策树算法的基本原理,并从实例费用和信息熵费用两个角度出发,对增量决策树算法的复杂度进行分析。通过实例说明,增量决策树算法能够构造出与ID3算法形态基本相同的决策树。

     

    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.

     

    • HTML全文
    • 参考文献(0)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回