Distributed learning with bagging-like performance

Pattern Recognition Letters

Volumn 24, Issue 1-3, 2003, Pages 455-471

  Chawla, Nitesh V ^a   Moore, Thomas E ^a   Hall, Lawrence O ^a   Bowyer, Kevin W ^b   Kegelmeyer, W Philip ^c   Springer, Clayton ^c  

^a University of South Florida   (United States)

^b University of Notre Dame   (United States)

^c SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Bagging; Distributed learning; Ensembles; Large data sets; Multiple classifiers

Indexed keywords

DATA REDUCTION; DATA STORAGE EQUIPMENT; DECISION THEORY; NEURAL NETWORKS;

DISJOINT PARTITIONS;

LEARNING SYSTEMS;

DATA PROCESSING;

EID: 0037235943     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00269-6     Document Type: Article

References (29)

1. Bauer, E., Kohavi, R., 1999. An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Machine Learning 36 (1,2).
2. Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E., 2000. The protein data bank. Nucleic Acids Research 28, 235-242, Available from .
3. Blake, C.L., Merz, C.J., 1998. UCI repository of machine learning databases. Available from .
4. Bowyer, K.W., Chawla, N.V., Moore Jr., I.E., Hall, L.O., Kegelmeyer, W.P., 2000. A parallel decision tree builder for mining very large visualization datasets. In: IEEE System, Man, and Cybernetics Conference, pp. 1888-1893.
5. Breiman, L., 1996. Bagging predictors. Machine Learning 24 (2), 123-140.
6. Breiman, L., 1999. Pasting bites together for prediction in large data sets. Machine Learning 36 (1-2), 85-103.
7. Chan, P., Stolfo, S., 1993. Towards parallel and distributed learning by meta-learning. In: Working Notes AAAI Workshop on Knowledge Discovery in Databases, pp. 227-240.
8. Chan, P., Stolfo, S., 1995. Learning arbiter and combiner trees from partitioned data for scaling machine learning. In: Proc. Intl. Conf. on Knowledge Discovery and Data Mining, pp. 39-44.
9. Chan, P., Stolfo, S., 1996. Scaling learning by meta-learning over disjoint and partially replicated data. In: Ninth Florida Artificial Intelligence Research Symposium, pp. 151-155.
10. Chawla, N., Moore Jr., T.E., Bowyer, K.W., Hall, L.O., Springer, C., Kegelmeyer, W.P., 2001. Bagging is a small-data-set phenomenon. In: IEEE Conf. on Computer Vision and Pattern Recognition, pp. 684-689.
11. Darlington, J., Guo, Y., Sutiwaraphun, J., To, H., 1997. Parallel induction algorithms for data mining. In: Advances in Intelligent Data Analysis Reasoning about Data, Second Internat. Symposium, IDA-9 7. Proc., pp. 437-445.
12. Dietterich, T., 2000. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning 40 (2), 139-158.
13. Domingos, P., 1996. Using partitioning to speed up specific-to-general rule induction. In: Proc. AAAI-96 Workshop on Integrating Multiple Learned Models. AAAI Press, Portland, OR, pp. 29-34.
14. Domingos, P., 1997. Why does bagging work? A Bayesian account and its implications. In: Proc. Third Internal. Conf. on Knowledge Discovery and Data Mining.
15. Fahlman, S.E., Lebiere, C., 1990. The cascade-correlation learning architecture. In: Advances in Neural Information Processing Systems 2. Morgan Kaufmann, Los Altos, CA.
16. Hall, L.O., Bowyer, K.W., Kegelmeyer, W.P., Moore Jr., T.E., Chao, C., 2000. Distributed learning on very large data sets. In: ACM SIGKDD Workshop on Distributed and Parallel Knowledge Discovery.
17. Hall, L.O., Chawla, N.V., Bowyer, K.W., Kegelmeyer, W.P., 1999. Learning rules from distributed data. In: ACM SIGKDD Workshop on Large-Scale Parallel Data Mining Systems.
18. Jones, D.T., 1999. Protein secondary structure prediction based on decision-specific scoring matrices. Journal of Molecular Biology 292, 195-202.
19. Lawrence Livermore National Laboratories, 2001. Protein structure prediction center. Available from .
20. Moore, A.W., Lee, M.S., 1998. Cached sufficient statistics for efficient machine learning with large datasets. Journal of Artificial Intelligence Research 8, 67-91.
21. Oates, T., Jensen, D., 1998. Large datasets lead to overly complex models: an explanation and a solution. In: Proc. Fourth Internal. Conf. on Knowledge Discovery and Data Mining, August.
22. Perlich, C., Provost, F., Simonoff, J., 2002. Tree induction vs. logistic regression: a learning-curve analysis. J. Machine Learning Res., in press.
23. Provost, F.J., Hennessy, D.N., 1996. Scaling up: Distributed machine learning with cooperation. In: Proc. 13th National Conf. on Artificial Intelligence. AAAI'96, pp. 74-79.
24. Provost, F.J., Jensen, D., Gates, T., 1999. Efficient progressive sampling. In: Proc. Fifth ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, pp. 23-32.
25. Quinlan, J.R., 1996. Bagging, boosting, and C4.5. In: Proc. Thirteenth National Conf. on Artificial Intelligence, pp. 725-730.
26. Quinlan, J.R., 1992. C4.5: Programs for Machine Learning. Morgan Kaufinann, San Mateo, CA.
27. Sandia National Labs, 1998. ASCI RED, the world's first teraops supercomputer. Available from .
28. Shafer, J., Agrawal, R., Mehta, M., 1996. Sprint: A scalable parallel classifier for data mining. In: Proc. 22nd VLDB Conf., Mumbai (Bombay), India, pp. 1-12.
29. Street, W.N., Kim, Y., 2001. A streaming ensemble algorithm (SEA) for large-scale classification. In: Provost, F., Srikant, R. (Ed.), KDD'01, San Francisco, CA, pp. 377-382.