Comparing pure parallel ensemble creation techniques against bagging

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 533-536

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

^a UNIVERSITY OF SOUTH FLORIDA   (United States)

^b University of Notre Dame   (United States)

^c SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (15)

1. E. Bauer and R. Kohavi. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learning, 36(1,2):105-139, 1999.
2. K. Bowyer, N. Chawla, J. T.E. Moore, L. Hall, and W. Kegelmeyer. A parallel decision tree builder for mining very large visualization datasets. In IEEE Systems, Man, and Cybernetics Conference, pages 1888-1893, 2000.
3. 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.
4. L. Breiman. Bagging predictors. Machine Learning, 24:123-140, 1996.
5. L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.
6. L. Breiman, J. Friedman, R. Olshen, and P. Stone. Classification and Regression Trees. Wadsworth International Group, Belmont, CA., 1984.
7. N. Chawla, T. Moore, L. Hall, K. Bowyer, W. Kegelmeyer, and C. Springer. Distributed learning with bagging-like performance. Pattern Recognition Letters, 24:455-471, 2003.
8. M. Collins, R. 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.
9. T. 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. T. Ho. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8):832-844, 1998.
11. 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.
12. C. Merz and P. Murphy. UCI Repository of Machine Learning Databases. Univ. of CA., Dept. of CIS, Irvine, CA. http://www.ics.uci.edu/~mlearn/ MLRepository.html.
13. J. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1992. San Mateo, CA.
14. R. Schapire. The strength of weak learnability. Machine Learning, 5(2):197-227, 1990.
15. I. H. Witten and E. Frank. Data Mining: Practical machine learning tools with Java implementations. Morgan Kaufmann, San Francisco, 1999.