| 决策树分类技术研究 |
| |
| 引用本文： | 栾丽华,吉根林.决策树分类技术研究[J].计算机工程,2004,30(9):94-96,105. |
| |
| 作者姓名： | 栾丽华 吉根林 |
| |
| 作者单位： | 南京师范大学计算机系,南京,210097 |
| |
| 基金项目： | 江苏省教育厅自然科学基金资助项目(2001SXXTSJB12) |
| |
| 摘 要： | 决策树分类是一种重要的数据分类技术。ID3、C4．和EC4．5是建立决策树的常用算法，但目前国内对一些新的决策树分类算法研究较少。为此，在消化大量文献资料的基础上，研究了CART、SLIQ、SPRINT、PUBLIC等新算法，对各种决策树分类算法的基本思想进行阐述，并分析比较了各种算法的主要特性，为数据分类研究者提供借鉴。
|
| 关 键 词： | 决策树 CART SLIQ SPRINT PUBLIC 数据分类 |
| 文章编号： | 1000-3428(2004)09-0094-03 |
The Study on Decision Tree Classification Techniques |
| |
| LUAN Lihua,JI Genlin.The Study on Decision Tree Classification Techniques[J].Computer Engineering,2004,30(9):94-96,105. |
| |
| Authors: | LUAN Lihua JI Genlin |
| |
| Abstract: | Decision tree is one of the most important data classification techniques. Algorithms ID3, C4.5 and EC4.5 are widely used to construct decision trees, but little work on new decision tree algorithms has been done. Some new decision tree algorithms are studied, including CART, SLIQ, SPRINT and PUBLIC. The basic ideas and main features of these algorithms are discussed in this paper. |
| |
| Keywords: | Decision tree CART SLIQ SPRINT PUBLIC |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
