Bagging with adaptive costs

IEEE Transactions on Knowledge and Data Engineering

Volumn 20, Issue 5, 2008, Pages 577-588

  Zhang, Yi ^a   Street, W Nick ^b  

^a MICROSOFT   (United States)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Data mining; Ensemble methods

Indexed keywords

BASE CLASSIFIERS; BASE LEARNERS; BASIC STRUCTURE; COMPUTATIONAL EXPERIMENT; ENSEMBLE LEARNING; ENSEMBLE METHODS; MISCLASSIFICATION COSTS; NOISY POINT;

LEARNING SYSTEMS;

CLASSIFIERS;

EID: 70350319675     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.190724     Document Type: Article

References (18)

1. A. Krogh and J. Vedelsby, "Neural Network Ensembles, Cross Validation, and Active Learning," Advances in Neural Information Processing Systems, G. Tesauro, D. Touretzky, and T. Leen, eds., vol.7, MIT Press, pp. 231-238, 1995, citeseer.nj.nec.com/ krogh95neural.html.
2. T.G. Dietterich, "Ensemble Methods in Machine Learning," Lecture Notes in Computer Science 1857, pp. 1-15, 2000, citeseer.nj. nec.com/dietterich00ensemble.html.
3. E. Bauer and R. Kohavi, "An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants," Machine Learning, vol.36, no.1-2, pp. 105-139, 1999, citeseer. ist.psu. edu/bauer99empirical.html.
4. D. Opitz and R. Maclin, "Popular Ensemble Methods: An Empirical Study," J. Artificial Intelligence Research, vol.11, pp. 169-198, 1999, citeseer.ist.psu.edu/opitz99popular.html.
5. T.G. Dietterich, "An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization," Machine Learning, vol.40, no.2, pp. 139-157, 2000.
6. L. Breiman, "Bagging Predictors," Machine Learning, vol.24, no.2, pp. 123-140, 1996, citeseer.nj.nec.com/breiman96bagging.html.
7. Y. Freund and R.E. Schapire, "Experiments with a New Boosting Algorithm," Proc. 13th Int'l Conf. Machine Learning, pp. 148-156, 1996, citeseer.nj.nec.com/freund96experiments.html.
8. L. Breiman, "Arcing Classifiers," Annals of Statistics, vol.26, pp. 801-849, 1998. (Pubitemid 128450035)
9. D.H. Wolpert, "Stacked Generalization," Neural Networks, vol.5, pp. 241-259, 1992, citeseer.nj.nec.com/wolpert92stacked.html.
10. L. Breiman, "Random Forests," Machine Learning, vol.45, no.1, pp. 5-32, 2001, citeseer.nj.nec.com/breiman01random.html.
11. A.J. Grove and D. Schuurmans, "Boosting in the Limit: Maximizing the Margin of Learned Ensembles," Proc. Conf Innovative Applications of AI (AAAI/IAAI '98), pp. 692-699, 1998, citeseer. ist.psu.edu/grove98boosting.html.
12. G. Ridgeway, "Discussion of Additive Logistic Regression: A Statistical View of Boosting," Annals of Statistics, vol.28, pp. 393-400, 2000.
13. P.S. Bradley, U.M. Fayyad, and O.L. Mangasarian, "Mathematical Programming for Data Mining: Formulations and Challenges," INFORMS J. Computing, vol.11, no.3, pp. 217-238, 1999, citeseer.nj. nec.com/ bradley98mathematical.html.
14. V.N. Vapnik, The Nature of Statistical Learning Theory. Springer, 1995.
15. C. Blake and C. Merz UCI Repository of Machine Learning Databases, http://www.ics.uci.edu/mlearn/MLRepository.html, 1998.
16. Y. Freund and R.E. Schapire, "A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting," Proc. European Conf. Computational Learning Theory, pp. 23-37, 1995, citeseer.nj.nec.com/article/ freund95decisiontheoretic.html.
17. S. Abney, R. Schapire, and Y. Singer, "Boosting Applied to Tagging and PP Attachment," Proc. Joint SIGDAT Conf. Empirical Methods in Natural Language Processing and Very Large Corpora, 1999, citeseer.nj.nec.com/ abney99boosting.html.
18. R.J. Quinlan, C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.