Scaling up a boosting-based learner via adaptive sampling

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

Volumn 1805, Issue , 2000, Pages 317-328

  Domingo, Carlos ^a   Watanabe, Osamu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; DATA MINING; DECISION TREES; ITERATIVE METHODS; LARGE DATASET;

ADAPTIVE SAMPLING; ADAPTIVE SAMPLING METHODS; BEST DECISION; BOOSTING ALGORITHM; DECISION STUMPS; EQUIVALENT ALGORITHM; EXPERIMENTAL EVALUATION; EXPERIMENTAL EVIDENCE;

LEARNING SYSTEMS;

EID: 84942801923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45571-x_37     Document Type: Conference Paper

References (23)

1. Bauer, E. and Kohavi, R. 1998. An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants. Machine Learning, 1-38, 1998.
2. Dietterich, T., 1998. An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization. Machine Learning, 32:1-22.
3. Domingo, C, Gavalda, R. and Watanabe, R., 1998. Praictical Algorithms for On-line Selection. Proceedings of the First International Conference on Discovery Science, DS'98. Lecture Notes in Artificial Intelligence 1532:150-161.
4. Domingo, C, Gavalda, R. and Watanabe, O., 1999. Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. Proceedings of the Second International Conference on Discovery Science, DS'99. Lecture Notes on Artificial Intelligence, 1721, pp. 172-183.
5. Domingo, C. and Watanabe, O., 1999. MadaBoost: A modification of AdaBoost. Tech Rep. C-133, Dept. of Math and Computing Science, Tokyo Institute of Technology. URL: http://www.is.titech.ac. jp/"carlos.
6. Domingo, C. and Watanabe, O., 1999. Experimental evaluation of a modification of AdaBoost for the filtering framework. Tech Rep. C-139, Dept. of Math and Computing Science, Tokyo Institute of Technology. URL: htt p: //www.is.titech.ac.jp/cztrlos.
7. P. Domingos and M. Pazzani. Beyond independence: Conditions for the optimality of the simple Bayesian classifier. Machine Learning, 29:2, 103-130, 1997.
8. Dougherty, J., Kohavi, R., and Sahami, M., 1995. Supervised and Unsupervised Discretization of Continuous Features. Proceedings of the Twelfth International Conference on Machine Learning.
9. Fayad, U.M. and Irani, K.B., 1993. Multi-interval discretization of continuous-valued attributes for classification learning. Proceedings of the 13th International Joint Conference on Artificial Intelligence, pp. 1022-1027.
10. Freund, Y., 1995. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256-285.
11. Freund, Y., and Schapire, R.E., 1997. A decision-theoretic generalization of on-line learning and an application to boosting. JCSS, 55(1):119-139.
12. Freund, Y., and Schapire, R.E., 1997. Experiments with a new boosting algorithm. Proceedings of the 13th International Conference on Machine Learning, 148-146.
13. R.C. Holte. Very simple classification rules perform well on most common datasets. Machine Learning, 11:63-91, 1993.
14. John, G. H. and Langley, P., 1996. Static Versus Dynamic Sampling for Data Mining. Proc. of the Second International Conference on Knowledge Discovery and Data Mining, AAAI/MIT Press.
15. Keogh, E., Blake, C. and Merz, C.J., 1998. UCI repository of machine learning databases, [http://www.ics.uci.ed u/ mleau-n/MLRepository.html]. Irvine, CA: University of California, Department of Information and Computer Science.
16. Lipton, R. J. and Naughton, J. F., 1995. Query Size Estimation by Adaptive Sampling. Journal of Computer and System Science, 51:18-25.
17. Lipton, R. J., Naughton, J. F., Schneider, D. A. and Seshadri, S., 1995. Efficient sampling strategies for relational database operations. Theoretical Computer Science, 116:195-226.
18. Provost, F., Jensen, D. and Gates, T., 1999. Efficient Progressive Sampling. Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining.
19. Quinlan, J. R., 1996. Bagging, Boosting and C4.5. Proceedings of the Thirteenth National Conference on Artificial Intelligence, AAAI Press and the MIT Press, pp. 725-723.
20. Quinlan, J. R., 1993. Ci.5: Programs for machine learning. Morgan Kaufmann, San Mateo, California.
21. Schapire, R. E., 1990. The strength of weak learnability. Machine Learning, 5(2):197-227.
22. Wald, A., 1947. Sequential Analysis. Wiley Mathematical, Statistics Series.
23. Watanabe, O., 1999. Prom Computational Learning Theory to Discovery Science. Proc. of the 26th International Colloquim on Automata, Languages and Programming, ICALP'99 Invited talk. Lecture Notes in Computer Science 1644:134-148.