Aggregation ordering in bagging

Proceedings of the IASTED International Conference. Applied Informatics

Volumn , Issue , 2004, Pages 258-263

  Martínez Muñoz, Gonzalo ^a   Suárez, Alberto ^a  

^a UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

Author keywords

Bagging; Decision trees; Ensemble pruning; Machine learning

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; DATABASE SYSTEMS; GENETIC ALGORITHMS; HEURISTIC METHODS; LEARNING SYSTEMS; TREES (MATHEMATICS); VECTORS;

BAGGING; DECISION TREES; ENSEMBLE PRUNING;

RANDOM ERRORS;

EID: 11144281845     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Y. Freund and R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, Proc. 2nd European Conference on Computational Learning Theory, 1995, 23-37
2. J. Quinlan, Bagging, boosting, and C4.5, Proc. 13th National Conference on Artificial Intelligence, Cambridge, MA, 1996, 725-730
3. L. Breiman, Bagging predictors, Machine Learning, 24(2), 1996, 123-140
4. L. Breiman, Arcing classifiers, The Annals of Statistics, 26(3), 1998, 801-849
5. R. Schapire, Y. Freund, P. Bartlett and W. Lee, Boosting the margin: A new explanation for the effective ness of voting methods, The Annals of Statistics, 12(5), 1998, 1651-1686
6. E. Bauer and R. Kohavi, An empirical comparison of voting classification algorithms: Bagging, boosting, and variants, Machine Learning, 36(1-2), 1999, 105-139
7. A.J.C. Sharkey, Combining Artificial Neural Nets: Ensemble and Modular Multi-Net Systems, (London, Springer-Verlag, 1999)
8. T.G. Dietterich, An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization, Machine Learning, 40(2), 2000, 139-157
9. G. Rätsch, T. Onoda and K.R. Müller, Soft margins for AdaBoost, Machine Learning, 42(3), 2001, 287-320
10. C. Tamon and J. Xiang, On the boosting pruning problem, Proc. 11th European Conference on Machine Learning, 2000, 404-412
11. D.D. Margineantu and T.G. Dietterich, Pruning adaptive boosting, Proc. 14th International Conference on Machine Learning, 1997, 211-218
12. C.L. Blake and C.J. Merz, UCI repository of machine learning databases [http://www.ics.uci.edu/~mlearn/mlrepository.html] (1998)
13. Z.H. Zhou, J. Wu and W. Tang, Ensembling neural networks: Many could be better than all, Artificial Intelligence, 137(1-2), 2002, 239-263
14. Z.H. Zhou and W. Tang, Selective ensemble of decision trees, Lecture Notes in Artificial Intelligence 2639, 2003, pp.476-483, Berlin: Springer, 2003
15. A.L. Prodromidis and S.J. Stolfo, Cost complexity-based pruning of ensemble classifiers, Knowledge and Information Systems, 3(4), 2001, 449-469
16. L. Breiman, J.H. Friedman, R.A. Olshen and C.J. Stone, Classification and Regression Trees, (New York, Chapman & Hall, 1984)
17. L. Breiman, Bias, variance, and arcing classifiers, Technical Report 460, Statistics Department, University of California, 1996
18. L. Breiman, Random forests, Machine Learning, 45(1), 2001, 5-32
19. G. Martínez-Muñoz and A. Suárez, Using all data to generate decision tree ensembles, IEEE Transactions on Systems, Man and Cybernetics C, accepted for publication, 2003