单位代价收益敏感决策树分类算法及其剪枝算法的研究计算机应用技术专业论文.docxVIP

Research Research on Unit Cost Gains Sensitive Decision Tree Classification and Pruning Algorithm Name：Zhou Meiqin Tutor：Zhu Xinhua Major：Computer Application Technology Research Area：Data Mining Grade：201 3 Abstract Data mining is an interdisciplinary in many research fields．The classification analysis algorithms have become a research hot focus in the field of data mining gradually,due to its widely application in the information industry field．The common classification techniques include the Decision Tree classification algorithm，Bayesian classification algorithm，Neural Network and Support Vector Machine(SVM)，k-Nearest Neighbor classification，and SO on． While the decision tree classification methods are adored by the researchers，with its fast speed， high precision．easy to be understood and other advantages．It has been researched and applied widely in the field of data mining． The main features of decision tree classification algorithms have four aspects．The first is the extended attribute selection criteria,the second is the criterion to stop the building of the tree， the third is the class label criterion of leaf nodes and the fourth is the pruning optimization strategies．At present，the research on decision tree classification algorithm mainly focuses on two aspects：the extended attribute selection criterion and the pruning optimization strategy．This paper also researches on these two aspects．There are two simple reasons for pruning the decision tree．The first，there is noise in the training data，which may make the generated decision tree over fitting to the training samples．Thus resulting in the classification effect to new actual data is not ideal．The second is the distribution of training data samples has the particularity,it will give rise to the generated decision tree cannot display the general rules．The paper expounded on pre··pruning algorithm and after··pruning algorithm systematically,and did a comparison analysis to several common post-pruning algori