一种基于规则集的决策树分类方法
首发时间:2011-10-31
摘要:在求解分类问题的方法中,决策树是最有用的方法之一。这种方法需要构建一棵树对分类过程进行建模。一旦建好了树,就可以将其应用于数据实例并得到分类结果。大多数的决策树都是训练自数据集。这种算法的弊端在于,样本集的数量过于庞大。当决策情况改变时,重新训练决策树的代价过高。本文提出了一种基于规则集的决策树训练方法。该方法包含了两个步骤:1-利用ID3算法把数据集保存成规则集;2-利用AO,AD,MVD三个属性选择标准,从规则集中提炼出决策树。在本文的仿真结果中可以看到,相对于ID3算法,由此方法训练出的决策树复杂度有了一定程度的降低。
For information in English, please click here
A rule-set based decision tree for classification
Abstract:Decision tree is one of the most useful tools for solving the classification problems. This method requires building a decision tree to model the process of classification. The tree can be applied to the data instance so as to produce the result of classification after it has been built. Most of the decision trees are the training based on the data set. The disadvantage of this method is that once the tree is built, it's difficult to modify it to suit different decision making situation because of the large scale of data set. This paper proposes a decision tree training method based on rule set. The method includes two steps: 1 - using ID3 algorithm to transform the data set into the rule set; 2- training the decision tree based on the rule set using three attribute selection criteria AO, AD and MVD. In the simulation results, it can be seen that the decision tree trained based on the rule set is less complex compared with one trained by ID3 algorithm.
Keywords: data mining decision tree rule set attribute selection criterion
基金:
论文图表:
引用
No.****
同行评议
共计0人参与
勘误表
一种基于规则集的决策树分类方法
评论
全部评论0/1000