A comparison of ensemble creation techniques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3077, Issue , 2004, Pages 223-232

  Banfield, Robert E ^a   Hall, Lawrence O ^a   Bowyer, Kevin W ^b   Bhadoria, Divya ^a   Philip Kegelmeyer, W ^c   Eschrich, Steven ^a  

^a University of South Florida   (United States)

^b 384 Fitzpatrick Hall ^*  (United States)

^c SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; FORESTRY;

ENSEMBLE TREES; IN-BUILDINGS; MULTIPLE TRAINING SETS; RANDOM FORESTS; RANDOM SUBSPACES; SELECTION OF ATTRIBUTES; STATISTICAL SIGNIFICANCE;

RANDOM PROCESSES;

EID: 33749418783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25966-4_22     Document Type: Article

References (20)

1. L. Breiman. Bagging predictors. Machine Learning, 24:123-140, 1996.
2. G. Eibl and K.P. Pfeiffer. How to make AdaBoost.M1 work for weak base classifiers by changing only one line of the code. In Proceedings of the Thirteenth European Conference on Machine Learning, pages 72-83, 2002.
3. M. Collins, R.E. Schapire, and Y. Singer. Logistic regression, AdaBoost and Bregman distances. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, pages 158-169, 2000.
4. R.E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197-227, 1990.
5. L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.
6. 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.
7. T.K. Ho. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8):832-844, 1998.
8. G. Hulten and P. Domingos. Learning from infinite data in finite time. In Advances in Neural Information Processing Systems 14, pages 673-680, Cambridge, MA, 2002. MIT Press.
9. K.W. Bowyer, N.V. Chawla, Jr. T.E. Moore, L.O. Hall, and W.P. Kegelmeyer. A parallel decision tree builder for mining very large visualization datasets. In IEEE Systems, Man, and Cybernetics Conference, pages 1888-1893, 2000.
10. N.V. Chawla, T.E. Moore, L.O. Hall, K.W. Bowyer, W.P. Kegelmeyer, and C. Springer. Distributed learning with bagging-like performance. Pattern Recognition Letters, 24:455-471, 2003.
11. C.J. Merz and P.M. Murphy. UCI Repository of Machine Learning Databases. Univ. of CA., Dept. of CIS, Irvine, CA. http://www.ics.uci.edu/~mlearn/ MLRepository.html.
12. Robert Banfield. The OpenDT project. Technical report, University of South Florida, http://www.csee.usf.edu/~rbanfiel/OpenDT.html, 2003.
13. J.R. Quinlan. C4-5: Programs for Machine Learning. Morgan Kaufmann, 1992. San Mateo, CA.
14. L.O. Hall, K.W. Bowyer, R.E. Banfield, D. Bhadoria, W.P. Kegelmeyer, and Steven Eschrich. Comparing pure parallel ensemble creation techniques against bagging. In The Third IEEE International Conference on Data Mining, pages 533-536, 2003.
15. P. Brazdil and J.Gama. The statlog project- evaluation / characterization of classification algorithms. Technical report, The STATLOG Project- Evaluation / Characterization of Classification Algorithms, http://www.ncc.up.pt/liacc/ML/ statlog/, 1998.
16. L. Breiman, J.H. Friedman, R.A. Olshen, and P.J. Stone. Classification and Regression Trees. Wadsworth International Group, Belmont, CA., 1984.
17. Ian H. Witten and Eibe Frank. Data Mining: Practical machine learning tools with Java implementations. Morgan Kaufmann, San Francisco, 1999.
18. J. C. de Borda. Memoire sur les elections au scrutin. Historie de lÁcademie Royale des Sciences, Paris, 1781.
19. T.K. Ho. A data complexity analysis of comparative advantages of decision forest constructors. Pattern Analysis and Applications, 5:102-112, 2002.
20. R.E. Banfield, L.O. Hall, K.W. Bowyer, and W. P. Kegelmeyer. A new ensemble diversity measure applied to thinning ensembles. In Multiple Classifier Systems Conference, pages 306-316, June 2003.