Focused ensemble selection: A diversity-based method for greedy ensemble selection

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 117-121

  Partalas, Ioannis ^b   Tsoumakas, Grigorios ^b   Vlahavas, Ioannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

% REDUCTIONS; 'CURRENT; DIVERSITY MEASURE; ENSEMBLE SELECTIONS; GREEDY SEARCH; ITS EFFICIENCIES; NOVEL METHODS; PREDICTIVE MODELS; PREDICTIVE PERFORMANCE; SELECTION METHODS;

ARTIFICIAL INTELLIGENCE;

EID: 85052001384     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-117     Document Type: Conference Paper

References (20)

1. A. Asuncion and D.J. Newman. UCI machine learning repository, 2007. http://www.ics.uci.edu/∼mlearn/MLRepository.html.
2. Robert E. Banfield, Lawrence O. Hall, Kevin W. Bowyer, and W. Philip Kegelmeyer, ‘Ensemble diversity measures and their application to thinning.’, Information Fusion, 6(1), 49–62, (2005).
3. L. Breiman, ‘Bagging Predictors’, Machine Learning, 24(2), 123–40, (1996).
4. R. Caruana, A. Niculescu-Mizil, G. Crew, and A. Ksikes, ‘Ensemble selection from libraries of models’, in Proceedings of the 21st International Conference on Machine Learning, (2004).
5. Janez Demsar, ‘Statistical comparisons of classifiers over multiple data sets’, Journal of Machine Learning Research, 7, 1–30, (2006).
6. T. G. Dietterich, ‘Ensemble Methods in Machine Learning’, in Proceedings of the 1st International Workshop in Multiple Classifier Systems, pp. 1–15, (2000).
7. Wei Fan, Fang Chu, Haixun Wang, and Philip S. Yu, ‘Pruning and dynamic scheduling of cost-sensitive ensembles’, in Eighteenth national conference on Artificial intelligence, pp. 146–151. AAAI, (2002).
8. Giorgio Giacinto and Fabio Roli, ‘An approach to the automatic design of multiple classifier systems’, Pattern Recognition Letters, 22(1), 25–33, (2001).
9. D. Margineantu and T. Dietterich, ‘Pruning adaptive boosting’, in Proceedings of the 14th International Conference on Machine Learning, pp. 211–218, (1997).
10. G. Martinez-Munoz and A. Suarez, ‘Aggregation ordering in bagging’, in International Conference on Artificial Intelligence and Applications (IASTED), pp. 258–263. Acta Press, (2004).
11. G. Martinez-Munoz and A. Suarez, ‘Pruning in ordered bagging ensembles’, in 23rd International Conference in Machine Learning (ICML-2006), pp. 609–616. ACM Press, (2006).
12. I. Partalas, G. Tsoumakas, I. Katakis, and I. Vlahavas, ‘Ensemble pruning using reinforcement learning’, in 4th Hellenic Conference on Artificial Intelligence (SETN 2006), pp. 301–310, (May 18–20 2006).
13. Robert E. Schapire, ‘The strength of weak learnability’, Machine Learning, 5, 197–227, (1990).
14. Christino Tamon and Jie Xiang, ‘On the boosting pruning problem’, in 11th European Conference on Machine Learning (ECML 2000), pp. 404–412. Springer-Verlag, (2000).
15. G. Tsoumakas, L. Angelis, and I. Vlahavas, ‘Selective fusion of heterogeneous classifiers’, Intelligent Data Analysis, 9(6), 511–525, (2005).
16. F. Wilcoxon, ‘Individual comparisons by ranking methods’, Biometrics, 1, 80–83, (1945).
17. I.H. Witten and E. Frank, Data Mining: Practical machine learning tools and techniques, Morgan Kaufmann, 2005.
18. D. Wolpert, The mathematics of generalization, Addison-Wesley, 1995.
19. Yi Zhang, Samuel Burer, and W. Nick Street, ‘Ensemble pruning via semi-definite programming’, Journal of Machine Learning Research, 7, 1315–1338, (2006).
20. Zhi-Hua Zhou and Wei Tang, ‘Selective ensemble of decision trees’, in 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2003, pp. 476–483, Chongqing, China, (May 2003).