A novel ensemble pruning algorithm based on randomized greedy selective strategy and ballot

Neurocomputing

Volumn 122, Issue , 2013, Pages 258-265

  Dai, Qun ^a  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

Author keywords

Classifier; Ensemble learning; Ensemble pruning; Machine learning; Pattern recognition

Indexed keywords

BENCHMARK CLASSIFICATION; CLASSIFICATION PERFORMANCE; ENSEMBLE LEARNING; ENSEMBLE PRUNING; RANDOMIZATION TECHNIQUES; SELECTIVE STRATEGIES; SOLUTION SPACE; SUBOPTIMAL SOLUTION;

CLASSIFIERS; LEARNING SYSTEMS; PATTERN RECOGNITION;

ALGORITHMS;

ARTICLE; CLASSIFICATION ALGORITHM; DIRECTED HILL CLIMBING ENSEMBLE PRUNING ALGORITHM; LEARNING ALGORITHM; MATHEMATICAL COMPUTING; METHODOLOGY; NOVEL ENSEMBLE PRUNING ALGORITHM; PATTERN RECOGNITION; PRIORITY JOURNAL; PROCESS DESIGN; RANDOMIZED GREEDY SELECTIVE STRATEGY AND BALLOT; UNCERTAINTY WEIGHTED ACCURACY; VALIDATION PROCESS; VALIDITY;

EID: 84884210298     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2013.06.026     Document Type: Article

References (26)

1. Y. Freund, R.E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting, in: Proceedings of the 2nd European Conference on Computational Learning Theory, 1995.
2. J. Quinlan. Bagging, boosting, and C4.5. In: Proceedings of the 13th National Conference on Artificial Intelligence, Cambridge, MA, 1996.
3. Breiman L. Bagging predictors. Mach. Learn. 1996, 24:123-140.
4. Breiman L. Arcing classifiers. Ann. Stat. 1998, 26:801-849.
5. Schapire R., Freund Y., Bartlett P., Lee W. Boosting the margin: a new explanation for the effectiveness of voting methods. Ann. Stat. 1998, 12:1651-1686.
6. Bauer E., Kohavi R. An empirical comparison of voting classification algorithms: bagging, boosting, and variants. Mach. Learn. 1999, 36:105-139.
7. Sharkey A.J.C. Combining Artificial Neural Nets: Ensemble and Modular Multi-Net Systems 1999, London Springer-Verlag.
8. Dietterich T. An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Mach. Learn. 2000, 40:139-158.
9. Rr̈atsch G., Onoda T., Mr̈uller K.R. Soft margins for AdaBoost. Mach. Learn. 2001, 42:287-320.
10. G. Martinez-Munoz, A. Suarez. Aggregation ordering in bagging, in: International Conference on Artificial Intelligence and Applications 2004.
11. R. Caruana, A. Munson, A. Niculescu-Mizil, Getting the most out of ensemble selection, in: Sixth International Conference on Data Mining, Hong Kong, 2006.
12. Hansen L.K., Salamon P. Neural network ensembles. IEEE Trans. Pattern Anal. Mach. Intell. 1990, 12:993-1001.
13. Krogh A., Vedelsby J. Neural network ensembles, cross validation, and active learning 1995, MIT Press, Cambridge, MA.
14. MartD́inez-Munoz G., HernD́andez-Lobato D., SuD́arez Alberto An analysis of ensemble pruning techniques based on ordered aggregation. IEEE Trans. Pattern Anal. Mach. Intell. 2009, 31:245-259.
15. Dai Q. A competitive ensemble pruning approach based on cross-validation technique. Knowledge-Based Systems 2013, 37:394-414.
16. R. Schapire. The boosting approach to machine learning: an overview, in: MSRI Workshop on Nonlinear Estimation and Classification, 2001.
17. Wolpert D.H. Stacked generalization. Neural Networks 1992, 5:241-259.
18. D. Margineantu, T. Dietterich, Pruning adaptive boosting in: Proceedings of the 14th International Conference on Machine Learning, 1997.
19. Prodromidis A.L., Stolfo S.J. Cost complexity-based pruning of ensemble classifiers. Knowl. Inf. Sys. 2001, 3:449-469.
20. Partalas I., Tsoumakas G., Vlahavas I. An ensemble uncertainty aware measure for directed hill climbing ensemble pruning. Mach. Learn. 2010, 81:257-282.
21. Banfield R.E., Hall L.O., Bowyer K.W., Kegelmeyer W.P. Ensemble diversity measures and their application to thinning. Inf. Fusion 2005, 6:49-62.
22. R. Caruana, A. Niculescu-Mizil, G. Crew, A. Ksikes. Ensemble selection from libraries of models, in: Proceedings of the 21st International Conference on Machine Learning, 2004.
23. Alsuwaiyel M.H. Algorithms Design Techniques and Analysis 2003, World Scientific Publishing Co. Pte. Ltd., Singapore.
24. Resende M.G.C., Ribeiro C.C. Greedy randomized adaptive search procedures. Handbook of Metaheuristics 2003, 219-249. Kluwer Academic Publishers. F. Glover, G. Kochenberger (Eds.).
25. UCI, UCI Repository of Machine Learning Databases.
26. Dai Q., Liu N.Z. The build of n-bits binary coding ICBP ensemble system. Neurocomputing 2011, 74:3509-3519.