规则简化与模糊决策树剪枝的比较  

A Comparative Analysis of Rule Simplification and Pruning Fuzzy Decision Trees

作　　者：孙娟[1] 王熙照[1] 

机构地区：[1]河北大学数学与计算机学院,保定071002

出　　处：《计算机工程》2006年第12期210-211,231,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60473045);河北省自然科学重点基金资助项目(603137)

摘　　要：决策树归纳学习算法是机器学习领域中解决分类问题的最有效工具之一。由于决策树算法自身的缺陷了,因此需要进行相应的简化来提高预测精度。模糊决策树算法是对决策树算法的一种改进,它更加接近人的思维方式。文章通过实验分析了模糊决策树、规则简化与模糊规则简化;模糊决策树与模糊预剪枝算法的异同,对决策树的大小、算法的训练准确率与测试准确率进行比较,分析了模糊决策树的性能,为改进该算法提供了一些有益的线索。Decision tree induction learns the implied rules from the training set, and then uses the learned rules to predict for unseen instances. However, the crisp decision trees often suffer from overfitting the training set in real-world induction tasks. So the pruning decision tree methods are necessary in the process of building crisp decision tree to improve performance. Fuzzy decision tree induction is an extension of crisp decision tree induction and is more close to the way of human thinking. In this paper, a comparative study is made among fuzzy decision tree algorithm, the simplified rules, and fuzzy simplified rules, fuzzy decision tree and fuzzy pre-pruning methods, with the aim of understanding their theoretical foundations, their performance and the strengths and weaknesses of their formulation. The empirical results show that fuzzy decision tree is superior to crisp simplified rules. The fuzzy pre-pruning decision tree can build a good tree even without simplified rules method.

关 键 词：归纳学习 决策树 模糊决策树 剪枝 规则简化 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]