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.
-
Key words:
- decision trees /
- incremental algorithm /
- complexity
-
點擊查看大圖
計量
- 文章訪問數: 183
- HTML全文瀏覽量: 27
- PDF下載量: 11
- 被引次數: 0
下載:
