Ensemble selection by GRASP

Applied Intelligence

Volumn 41, Issue 1, 2014, Pages 128-144

  Liu, Zhuan ^a   Dai, Qun ^a   Liu, Ningzhong ^a  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

Author keywords

Directed Hill Climbing Ensemble Pruning algorithm (DHCEP); Diversity; Ensemble selection; Ensemble Selection algorithm based on GRASP (GraspEnS); Greedy Randomized Adaptive Search Procedure (GRASP)

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; HEURISTIC ALGORITHMS;

COMBINATORIAL OPTIMIZATION PROBLEMS; DIVERSITY; ENSEMBLE PRUNING; ENSEMBLE SELECTIONS; EVALUATION MEASURES; GREEDY APPROACHES; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE; LOCAL OPTIMAL PROBLEMS;

OPTIMIZATION;

EID: 84957436616     PISSN: 0924669X     EISSN: 15737497     Source Type: Journal    
DOI: 10.1007/s10489-013-0510-0     Document Type: Article

References (46)

1. Freund Y, Schapire RE (1997) A decision-theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci 55:119–139
2. Quinlan J (1996) Bagging, boosting, and C4.5. Presented at proc. 13th national conference on artificial intelligence, Cambridge, MA
3. Breiman L (1996) Bagging predictors. Mach Learn 24:123–140
4. Breiman L (1998) Arcing classifiers. Ann Stat 26:801–849
5. Bauer E, Kohavi R (1999) An empirical comparison of voting classification algorithms: bagging, boosting, and variants. Mach Learn 36:105–139
6. Sharkey AJC (1999) Combining artificial neural nets: ensemble and modular multi-net systems. Springer, London
7. Rätsch G, Onoda T, Müller KR (2001) Soft margins for AdaBoost. Mach Learn 42:287–320
8. Martinez-Munoz G, Suarez A (2004) Aggregation ordering in bagging. Presented at international conference on artificial intelligence and applications
9. Schapire R, Freund Y, Bartlett P, Lee W (1998) Boosting the margin: a new explanation for the effectiveness of voting methods. Ann Stat 12:1651–1686
10. Margineantu D, Dietterich T (1997) Pruning adaptive boosting. Presented at proceedings of the 14th international conference on machine learning
11. Idris A, Khan A, Lee YS (2013) Intelligent churn prediction in telecom: employing mRMR feature selection and RotBoost based ensemble classification. Appl Intell 39:659–672
12. Nadig K, Potter W, Hoogenboom G, McClendon R (2013) Comparison of individual and combined ANN models for prediction of air and dew point temperature. Appl Intell 39:354–366
13. Park S, Lee SR (2013) Red tides prediction system using fuzzy reasoning and the ensemble method. Appl Intell. doi:10.1007/s10489-013-0457-1
14. Caruana R, Munson A, Niculescu-Mizil A (2006) Getting the most out of ensemble selection. Presented at sixth international conference on data mining, Hong Kong
15. Banfield RE, Hall LO, Bowyer KW, Kegelmeyer WP (2005) Ensemble diversity measures and their application to thinning. Inf Fusion 6:49–62
16. Li N, Yu Y, Zhou Z-H (2012) Diversity regularized ensemble pruning. In: Machine learning and knowledge discovery in databases. Springer, Berlin, pp 330–345
17. Tsoumakas G, Partalas I, Vlahavas I (2009) An ensemble pruning primer. In: Applications of supervised and unsupervised ensemble methods. Springer, Berlin, pp 1–13
18. Zhenyu L, Xindong W, Xingquan Z, Josh B (2010) Ensemble pruning via individual contribution ordering
19. Zhang Y, Burer S, Street WN (2006) Ensemble pruning via semi-definite programming. J Mach Learn Res 7:1315–1338
20. Martínez-Muñoz G, Suárez A (2005) Switching class labels to generate classification ensembles. Pattern Recognit 38:1483–1494
21. Partalas I, Tsoumakas G, Vlahavas I (2009) Pruning an ensemble of classifiers via reinforcement learning. Neurocomputing 72:1900–1909
22. Zhou Z-H, Wu J, Tang W (2002) Ensembling neural networks: many could be better than all. Artif Intell 137:239–263
23. Martinez-Munoz G, Suarez A (2007) Using boosting to prune bagging ensembles. Pattern Recognit Lett 28:156–165
24. Tsoumakas G, Angelis L, Vlahavas I (2005) Selective fusion of heterogeneous classifiers. Intell Data Anal 9:511–525
25. Dai Q (2013) A competitive ensemble pruning approach based on cross-validation technique. Knowl-Based Syst 37:394–414
26. Dai Q, Liu Z (2013) ModEnPBT: a modified backtracking ensemble pruning algorithm. Appl Soft Comput 13:4292–4302
27. Caruana R, Niculescu-Mizil A, Crew G, Ksikes A (2004) Ensemble selection from libraries of models. Presented at proceedings of the 21st international conference on machine learning
28. Zhou Z-H (2012) Ensemble methods: foundations and algorithms. Chapman and Hall/CRC Press, London/Boca Raton
29. Tsoumakas G, Partalas I, Vlahavas I (2009) Applications of supervised and unsupervised ensemble methods, vol 245. Springer, Berlin
30. Lee H, Kim E, Pedrycz W (2012) A new selective neural network ensemble with negative correlation. Appl Intell 37:488–498
31. Tamon C, Xiang J (2000) On the boosting pruning problem. Presented at 11th European conference on machine learning, Springer, Berlin
32. Partalas I, Tsoumakas G, Vlahavas I (2010) An ensemble uncertainty aware measure for directed hill climbing ensemble pruning. Mach Learn 81:257–282
33. Dai Q (2013) A novel ensemble pruning algorithm based on randomized greedy selective strategy and ballot. Neurocomputing 122:258–265
34. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109–133
35. Gevezes T, Pitsoulis L (2013) A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem. J Comb Optim, 1–25
36. Mousavi SR, Babaie M, Montazerian M (2012) An improved heuristic for the far from most strings problem. J Heuristics 18:239–262
37. Resende MGC, Ribeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic, Norwell, pp 219–249
38. Festa P, Resende MGC (2002) GRASP: an annotated bibliography. Kluwer Academic, Norwell
39. Layeb A, Selmane M, Bencheikh Elhoucine M (2013) A new greedy randomized adaptive search procedure for multiple sequence alignment. Int J Bioinform Res Appl 9:1–14
40. Fan W, Chu F, Wang H, Yu PS (2002) Pruning and dynamic scheduling of cost-sensitive ensembles. Presented at eighteenth national conference on artificial intelligence, American association for artificial intelligence
41. Partalas I, Tsoumakas G, Vlahavas I (2012) A study on greedy algorithms for ensemble pruning. Technical report TR-LPIS-360-12, Department of Informatics, Aristotle University of Thessaloniki, Greece
42. Martinez-Muoz G, Hernández-Lobato D, Suárez A (2009) An analysis of ensemble pruning techniques based on ordered aggregation. IEEE Trans Pattern Anal Mach Intell 31:245–259
43. Tang E, Suganthan P, Yao X (2006) An analysis of diversity measures. Mach Learn 65:247–271
44. Martinez-Munoz G, Hernandez-Lobato D, Suarez A (2009) An analysis of ensemble pruning techniques based on ordered aggregation. IEEE Trans Pattern Anal Mach Intell 31:245–259
45. Asuncion A, Newman DJ (2007) UCI machine learning repository
46. Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30