| 区间值属性决策树学习算法* |
| |
| 引用本文： | 王熙照,洪家荣. 区间值属性决策树学习算法*[J]. 软件学报, 1998, 9(8): 637-640 |
| |
| 作者姓名： | 王熙照 洪家荣 |
| |
| 作者单位： | 哈尔滨工业大学计算机科学系,哈尔滨,150001 |
| |
| 基金项目： | 本文研究得到河北省自然科学基金资助. |
| |
| 摘 要： | 该文提出了一种区间值属性决策树的学习算法.区间值属性的值域不同于离散情况下的无序集和连续情况下的全序集,而是一种半序集.作为ID3算法在区间值意义下的推广,算法通过一种分割信息熵的极小化来选取扩展属性.通过非平稳点分析,减少了分割信息熵的计算次数,使算法的效率得到了提高.
|
| 关 键 词： | 机器学习 归纳学习 决策树 区间值属性. |
| 收稿时间： | 1996-11-05 |
| 修稿时间： | 1997-07-18 |
Learning Algorithm of Decision Tree Generation for Interval-Valued Attributes |
| |
| WANG Xi-zhao and HONG Jia-rong. Learning Algorithm of Decision Tree Generation for Interval-Valued Attributes[J]. Journal of Software, 1998, 9(8): 637-640 |
| |
| Authors: | WANG Xi-zhao and HONG Jia-rong |
| |
| Affiliation: | Department of Computer Science Harbin Institute of Technology Harbin 150001 |
| |
| Abstract: | The authors present a learning algorithm of decision tree generation for interval-valued attributes. With regard to range of value, a nominal attribute is not ordered and a continuous-valued attribute is linearly ordered, but the interval-valued attribute is partially ordered. As a generalization of ID3-algorithm on intervals, this algorithm uses minimal information entropy of partitioning to select the extended attributes. The efficiency of the algorithm is improved by analyzing unstable cut points. |
| |
| Keywords: | Machine learning induction decision trees interval-valued attributes. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
