Selective ensemble of decision trees

作者: Zhi-Hua Zhou , Wei Tang

DOI: 10.1007/3-540-39205-X_81

关键词: Machine learningComponent (UML)Artificial neural networkTask (project management)Ensemble learningArtificial intelligenceComputer scienceDecision treeGeneralization

摘要: An ensemble is generated by training multiple component learners for a same task and then combining their predictions. In most algorithms, all the trained are employed in constituting an ensemble. But recently, it has been shown that when neural networks, may be better to some instead of learners. this paper, claim generalized situations where decision trees. Experiments show ensembles selective algorithm, which selects C4.5 trees make up ensemble, not only smaller size but also stronger generalization than non-selective algorithms.

参考文章(27)
David H. Wolpert, Original Contribution: Stacked generalization Neural Networks. ,vol. 5, pp. 241- 259 ,(1992) , 10.1016/S0893-6080(05)80023-1
Richard Maclin, Lars Asker, Ensembles as a sequence of classifiers international joint conference on artificial intelligence. ,vol. 2, pp. 860- 865 ,(1997)
Tao Xiong, V. Cherkassky, A combined SVM and LDA approach for classification international joint conference on neural network. ,vol. 3, pp. 1455- 1459 ,(2005) , 10.1109/IJCNN.2005.1556089
Thomas G. Dietterich, Dragos D. Margineantu, Pruning Adaptive Boosting international conference on machine learning. pp. 211- 218 ,(1997)
Christino Tamon, Jie Xiang, On the Boosting Pruning Problem european conference on machine learning. pp. 404- 412 ,(2000) , 10.1007/3-540-45164-1_41
K. M. Ting, I. H. Witten, Issues in stacked generalization Journal of Artificial Intelligence Research. ,vol. 10, pp. 271- 289 ,(1999) , 10.1613/JAIR.594
Michael Bonnell Harries, Boosting a Strong Learner: Evidence Against the Minimum Margin international conference on machine learning. pp. 171- 180 ,(1999)
J. R. Quinlan, Bagging, boosting, and C4.S national conference on artificial intelligence. pp. 725- 730 ,(1996)