Ensemble pruning via individual contribution ordering

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 871-880

  Lu, Zhenyu ^a   Wu, Xindong ^a,b   Zhu, Xingquan ^c   Bongard, Josh ^a  

^a University of Vermont   (United States)

^b HEFEI UNIVERSITY OF TECHNOLOGY   (China)

^c UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Ensemble learning; Ensemble pruning

Indexed keywords

COMPUTATIONAL COSTS; DATA SETS; ENSEMBLE LEARNING; ENSEMBLE MEMBERS; ENSEMBLE METHODS; ENSEMBLE PRUNING; INDIVIDUAL CLASSIFIERS; MEMORY CONSUMPTION; MINORITY GROUPS; RESOURCE AVAILABILITY; RESOURCE CONSUMPTION; RESPONSE TIME; WAITING-TIME;

CLASSIFIERS;

FORECASTING;

EID: 77956210291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835914     Document Type: Conference Paper

References (25)

1. A. Asuncion and D. Newman. UCI machine learning repository, 2007.
2. R. E. Banfield, L. O. Hall, K. W. Bowyer, and W. P. Kegelmeyer. Ensemble diversity measures and their application to thinning. Information Fusion, 6(1):49-62, 2005.
3. A. Bifet, G. Holmes, B. Pfahringer, R. Kirkby, and R. Gavaldá. New ensemble methods for evolving data streams. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pages 139-148, 2009.
4. L. Breiman. Bagging predictors. Machine Learning, 24(2):123-140, 1996.
5. L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.
6. R. Caruana, A. Munson, and A. Niculescu-Mizil. Getting the most out of ensemble selection. In Proceedings of the 6th International Conference on Data Mining, pages 828-833, 2006.
7. R. Caruana and A. Niculescu-Mizil. An empirical comparison of supervised learning algorithms. In Proceedings of the 23rd International Conference on Machine Learning, pages 161-168, 2006.
8. T. G. Dietterich. Ensemble methods in machine learning. In Proceedings of the 1st International Workshop on Multiple Classifier Systems, pages 1-15, 2000.
9. T. G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting and randomization. Machine Learning, 40:2:139-157, 2000.
10. W. Fan, H. Wang, P. S. Yu, and S. Ma. Is random model better? on its accuracy and efficiency. In Proceedings of the 3rd IEEE International Conference on Data Mining, pages 51-58, 2003.
11. Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
12. T. K. Ho. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8):832-844, 1998.
13. L. I. Kuncheva and C. J. Whitaker. Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Machine Learning, 51(2):181-207, 2003.
14. D. D. Margineantu and T. G. Dietterich. Pruning adaptive boosting. In Proceedings of the 14th International Conference on Machine Learning, pages 211-218, 1997.
15. G. Martínez-Munoz, D. Hernández-Lobato, and A. Suárez. An analysis of ensemble pruning techniques based on ordered aggregation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(2):245-259, 2009.
16. G. Martínez-Munoz and A. Suárez. Pruning in ordered bagging ensembles. In Proceedings of the 23rd International Conference on Machine Learning, pages 609-616, 2006.
17. I. Partalas, G. Tsoumakas, and I. Vlahavas. Focused ensemble selection: A diversity-based method for greedy ensemble selection. In Proceeding of the 18th European Conference on Artificial Intelligence, pages 117-121, 2008.
18. J. R. Quinlan. C4.5: programs for machine learning. Morgan Kaufmann, San Francisco, CA, USA, 1993.
19. C. Tamon and J. Xiang. On the boosting pruning problem. In Proceedings of the 11th European Conference on Machine Learning, pages 404-412, 2000.
20. I. H. Witten and E. Frank. Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, San Francisco, 2005.
21. D. H. Wolpert. Stacked generalization. Neural Networks, 5(2):241-259, 1992.
22. X. Wu, V. Kumar, J. R. Quinlan, J. Ghosh, Q. Yang, H. Motoda, G. J. McLachlan, A. Ng, B. Liu, P. S. Yu, Z.-H. Zhou, M. Steinbach, D. J. Hand, and D. Steinberg. Top 10 algorithms in data mining. Knowledge and Information Systems, 14(1):1-37, 2008.
23. Y. Zhang, S. Burer, and W. N. Street. Ensemble pruning via semi-definite programming. The Journal of Machine Learning Research, 7:1315-1338, 2006.
24. Z.-H. Zhou and W. Tang. Selective ensemble of decision trees. Lecture Notes in Computer Science, 2639:476-483, 2003.
25. Z.-H. Zhou, J. Wu, and W. Tang. Ensembling neural networks: many could be better than all. Artificial Intelligence, 137(1-2):239-263, 2002.