摘要
介绍了增量决策树算法的基本原理,并从实例费用和信息熵费用两个角度出发,对增量决策树算法的复杂度进行分析。通过实例说明,增量决策树算法能够构造出与ID3算法形态基本相同的决策树。
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.
出处
《北京科技大学学报》
EI
CAS
CSCD
北大核心
2004年第2期202-205,共4页
Journal of University of Science and Technology Beijing
基金
国家自然科学基金(No.50074005)
