基于统计学法则的连续属性值划分方法

摘要

目前决策树中很多分类算法例如ID3/C4.5/C5.0等都依赖于离散的属性值,并且希望将它们的值域划分到一个有限区间.利用统计学法则,提出一种新的连续属性值的划分方法;该方法通过统计学法则来发现精准的合并区间.另外在此基础上,为提高决策树算法分类学习性能,提出一种启发式的划分算法来获得理想的划分结果.在UCI真实数据集上进行仿真实验.结果表明获得了一个比较高的分类学习精度、与常见的划分算法比较起来有很好的分类学习能力.%Many classification algorithms such as ID3/C4.5/C5.0 decision tree algorithms rely on discrete at-tributes and need to quantify continuous attributes into a finite number of intervals.A new data partition method for continuous attributes was presented.This approach used a statistical criterion to discover the accurate discrete inter-vals which was required to merge.In order to promote the classification performance of decision tree algorithm,a heuristic algorithm was also discussed to gain excellent the quantify results.A serials of simulation had been done using UCI data sets.The experiments results and performance analysis show approach is a good partition model, C4.5 decision tree classification algorithm can benefit a lot from our method.