Stochastic ensemble pruning method via simulated quenching walking

作者: Zahra Sadat Taghavi , Seyed Taghi Akhavan Niaki , Amir Hossein Niknamfar

DOI: 10.1007/S13042-018-00912-3

关键词:

摘要: Inspired by an upward stochastic walking idea, a new ensemble pruning method called simulated quenching (SQWALKING) is developed in this paper. The rationale behind to give values movements as well accept unvalued solutions during the investigation of search spaces. SQWALKING incorporates and forward selection methods choose models through using probabilistic steps. Two versions are introduced based on two different evaluation measures; SQWALKINGA that accuracy measure SQWALKINGH human-like foresight measure. main objective construct proper architecture pruning, which independent construction combination phases. Extensive comparisons between proposed competitors terms heterogeneous homogeneous ensembles performed ten datasets. show can lead respectively 5.13% 4.22% average improvement. One reason for these promising results phase takes additional time find best compared rivals. Finally, SQWALKINGs also evaluated real-world dataset.

参考文章(47)
Thomas G. Dietterich, Ensemble Methods in Machine Learning Multiple Classifier Systems. pp. 1- 15 ,(2000) , 10.1007/3-540-45014-9_1
Thomas G. Dietterich, Dragos D. Margineantu, Pruning Adaptive Boosting international conference on machine learning. pp. 211- 218 ,(1997)
Vipin Kumar, Pang-Ning Tan, Michael M. Steinbach, Introduction to Data Mining ,(2013)
Janez Demšar, Statistical Comparisons of Classifiers over Multiple Data Sets Journal of Machine Learning Research. ,vol. 7, pp. 1- 30 ,(2006)
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
Zhi-Hua Zhou, Wei Tang, Selective ensemble of decision trees granular computing. pp. 476- 483 ,(2003) , 10.1007/3-540-39205-X_81
Ioannis Partalas, Grigorios Tsoumakas, Ioannis Vlahavas, An ensemble uncertainty aware measure for directed hill climbing ensemble pruning Machine Learning. ,vol. 81, pp. 257- 282 ,(2010) , 10.1007/S10994-010-5172-0