期刊文献+

一种基于神经网络集成的决策树构造方法 被引量:3

A Decision Tree Algorithm Based on Neural Network Ensemble
在线阅读 下载PDF
导出
摘要 神经网络集成方法具有比单个神经网络更强的泛化能力,却因为其黑箱性而难以理解;决策树算法因为分类结果显示为树型结构而具有良好的可理解性,泛化能力却比不上神经网络集成。该文将这两种算法相结合,提出一种决策树的构造算法:使用神经网络集成来预处理训练样本,使用C4.5算法处理预处理后的样本并生成决策树。该文在UC I数据上比较了神经网络集成方法、决策树C4.5算法和该文算法,实验表明:该算法具有神经网络集成方法的强泛化能力的优点,其泛化能力明显优于C4.5算法;该算法的最终结果显示为决策树,显然具有良好的可理解性。 Neural network ensemble is with stronger generalization ability compared with a single neural network. But the ensemble is lack of comprehensibility because it is regarded as a ‘black box'. And decision tree is with good comprehensibility. But its generalization ability can not be compared with neural network ensemble. In this paper, an algorithm for building a decision tree is proposed which combines the merits of both the neural network ensemble and the decision tree. The algorithm uses neural network ensemble to reprocess the training set then forms a C4. 5 decision tree. Experimental results are compared among neural network ensemble, decision tree and the algorithm introduced in this paper. Experiments show that the algorithm in this paper is with strong generalization ability inherited from neural network ensemble and it has stronger generalization than C4. 5 decision tree. Because the result of the algorithm is shown as a tree, the algorithm has good comprehensibility.
出处 《计算机仿真》 CSCD 2006年第11期95-98,共4页 Computer Simulation
关键词 神经网络集成 神经网络分类器 决策树 Neural network ensemble Neural network classifiers Decision tree
  • 相关文献

参考文献5

二级参考文献29

  • 1从爽.面向MATLAB工具箱的神经网络理论与应用[M].合肥:中国科技大学出版社,1998.59-60.
  • 2[1]Krogh A, Vedelsby J. Neural Network Ensembles, Cross Validation,and Active Learning [A]. Advances in Neural Information Processing Systems 7[C]. Cambridge, MA: MIT Press, 1995
  • 3[2]Wu J X, Zhou Z H, Chen Z Q. Ensemble of GA Based Selective Neural Network Ensembles [A]. Shanghai: Proceedings of the 8th International Conference on Neural Intormation Processing[C], 2001,3:1477-1482
  • 4[3]Zhou Z H, Wu J, Tang W. Ensembling Neural Networks: Many Could be Better Than All[J]. Artificial Intelligence, 2002, 137( 1-2): 239-263
  • 5[4]Puuronen S, Terziyan V, Tsymbal A. A Dynamic Integration Algorithm for an Ensemble of Classifiers[A]. Springer-Verlag, Warsaw:Foundations of Intelligent Systems: ISMIS99, LNAI[C], 1999, 1609:592-600
  • 6[5]Cost S, Salzberg S. A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features[J]. Machine Learning. 1993, 10(1):57-78
  • 7S Muggleton. Inductive logic programrnmg. In: S Muggleton ed. Inductive Logic Programming, London: Academic Press, 1992. 3-27.
  • 8Hong J. AEI: An extension matrix approximate method for the general covering problem. International Journal of Computer and Information Sciences, 1985, 14(6): 421-437.
  • 9J R Quinlan. CA. 5 : Programs for Machine Learning. San Mateo, CA: Morgan Kaufmarm, 1993.
  • 10M W Craven, J W Shavlik. Extracting tree-structured representations of trained neural networks. In: D Touretzky, M Mazer, M Hasselmo ecls. Advances in Neural Information Processing Systems 8, Cambridge, MA.. MIT Press, 1996.24 - 30.

共引文献265

同被引文献26

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部