引用本文:王熙照,洪家荣.区间值属性决策树学习算法*.软件学报,1998,9(8):637-640
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 4360次   下载 5389 本文二维码信息
码上扫一扫!
分享到: 微信 更多
区间值属性决策树学习算法*
王熙照1, 洪家荣1
哈尔滨工业大学计算机科学系,哈尔滨,150001
摘要:
该文提出了一种区间值属性决策树的学习算法.区间值属性的值域不同于离散情况下的无序集和连续情况下的全序集,而是一种半序集.作为ID3算法在区间值意义下的推广,算法通过一种分割信息熵的极小化来选取扩展属性.通过非平稳点分析,减少了分割信息熵的计算次数,使算法的效率得到了提高.
关键词:  机器学习,归纳学习,决策树,区间值属性.
DOI:
分类号:
基金项目:本文研究得到河北省自然科学基金资助.
Learning Algorithm of Decision Tree Generation for Interval-Valued Attributes
WANG Xi-zhao,HONG Jia-rong
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.
Key words:  Machine learning, induction, decision trees, interval-valued attributes.