关于用户兴趣度的判定树算法的优化  

Optimization of the Decision Tree Algorithm about of Interest Degree about Customers

作　　者：王睿[1] 钟守铭[1] 杨景浩[2] 

机构地区：[1]电子科技大学应用数学学院,成都610054 [2]成都大学计算机科学技术系,成都610106

出　　处：《计算机与数字工程》2006年第2期24-25,35,共3页Computer & Digital Engineering

摘　　要：判定树学习有很多算法,着重研究对引入用户兴趣度参数的ID3算法在面对多值属性时的快速分类的优化,提高计算速度,节约计算时间。There are a lot of algorithms to the decision tree , the emphasis of this article is the research in Optimization of the decision tree algorithm about of interest degree about customers which is based on algorithm of ID3, the last p.urpose is to improve the computational speed, and economize computational time.

关 键 词：判定树 归纳学习 ID3算法 机器学习 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]