摘要
Abstract
The Hunt algorithm is the basis of many popular decision tree algorithms.Through the former research,it is found that the Hunt algorithm occurs from time to time with low accuracy,which will lead to the lack of accuracy in the process of using it.In this regard,the Hunt algorithm is deeply considered in data mining,and a relative improvement algorithm is proposed,i.e.,the Hunt-M algorithm,the main process of this algorithm,i.e.,the introduction of the parameter M,is improved during the pruning process of the original algorithm,aiming to improve the accuracy of the algorithm.Through many experiments,it is proved that this algorithm can improve the accuracy of the algorithm.关键词
Hunt算法/决策树/数据挖掘/剪枝操作/算法准确率Key words
Hunt algorithm/decision tree/data mining/pruning operation/algorithm accuracy分类
信息技术与安全科学
