%0 Journal Article
%T Two algorithms of pre-pruning decision tree<br>两种决策树的事前修剪算法
%A QU Jun-feng
%A ZHU Li
%A HU Bin
%A <br>屈俊峰
%A 朱莉
%A 胡斌
%J 计算机应用
%D 2006
%I 
%X Pruning decision tree may occur in the process of creating decision tree or after that, the former is called pre-pruning. Every node on decision tree has a corresponding sample set. By analyzing the quantity of sample in the sample set or the purity of it, algorithm PDTBS, viz. pre-pruning decision tree based on support, and algorithm PDTBP, viz. pre-pruning decision tree based on purity were put forward. For pre-pruning, PDTBS prevented the node of a small sample set from extending; PDTBP prevented the node of a high purity sample set from extending. The time complexities of two algorithms were analyzed linear. Experiment results on UCI data show that the two algorithms can pre-prune decision tree to a great extent, while all its accuracy hardly diminishes.
%K decision tree
%K pre-pruning
%K support
%K purity<br>决策树
%K 事前修剪
%K 支持度
%K 纯度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=1C622EA9B153DD5D&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=38B194292C032A66&sid=2B6C525BCE31A7DA&eid=1BF6B0D4B001FBB8&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=8