FilterBoost: Regression and classification on large datasets

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Bradley, Joseph K ^a   Schapire, Robert E ^b  

^a Carnegie Mellon University   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS;

CONDITIONAL PROBABILITY ESTIMATION; FILTERBOOST; LARGE DATASETS; LOGISTICS REGRESSIONS; OVERFITTING; PROPERTY; REGRESSION TECHNIQUES; TRAINING SETS;

CLASSIFICATION (OF INFORMATION);

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

References (16)

1. Freund, Y., & Schapire, R. E. (1997) A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55, 119-139. (Pubitemid 127433398)
2. Schapire., R. E. (1990) The strength of weak learnability. Machine Learning, 5(2), pp. 197-227.
3. Freund, Y. (1995) Boosting a weak learning algorithm by majority. Information and Computation, 121, pp. 256-285.
4. Freund, Y. (1992) An improved boosting algorithm and its implications on learning complexity. 5th Annual Conference on Computational Learning Theory, pp. 391-398. (Pubitemid 23615443)
5. Domingo, C., & Watanabe, O. (2000) MadaBoost: a modification of AdaBoost. 13th Annual Conference on Computational Learning Theory, pp. 180-189.
6. Bshouty, N. H., & Gavinsky, D. (2002) On boosting with polynomially bounded distributions. Journal of Machine Learning Research, 3, pp. 483-506.
7. Gavinsky, D. (2003) Optimally-smooth adaptive boosting and application to agnostic learning. Journal of Machine Learning Research, 4, pp. 101-117.
8. Hatano, K. (2006) Smooth boosting using an information-based criterion. 17th International Conference on Algorithmic Learning Theory, pp. 304-319.
9. Schapire, R. E., & Singer, Y. (1999) Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37, 297-336. (Pubitemid 32210620)
10. Collins, M., Schapire, R. E., & Singer, Y. (2002) Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48, pp. 253-285. (Pubitemid 34247580)
11. Watanabe, O. (2000) Simple sampling techniques for discovery science. IEICE Trans. Information and Systems, E83-D(1), 19-26. (Pubitemid 30558806)
12. Domingo, C., Galvadà, R., & Watanabe, O. (2002) Adaptive sampling methods for scaling up knowledge discovery algorithms. Data Mining and Knowledge Discovery, 6, pp. 131-152. (Pubitemid 37113869)
13. Friedman, J., Hastie, T., & Tibshirani, R. (2000) Additive logistic regression: a statistical view of boosting. The Annals of Statistics, 28, 337-407. (Pubitemid 33227445)
14. Shalev-Shwartz, S., & Singer, Y. (2006) Convex repeated games and Fenchel duality. Advances in Neural Information Processing Systems 20.
15. Breiman, L. (1998) Arcing classifiers. The Annals of Statistics, 26, pp. 801-849. (Pubitemid 128450035)
16. Newman, D. J., Hettich, S., Blake, C. L., & Merz, C. J. (1998) UCI Repository of machine learning databases [http://www.ics.uci.edu/-mlearn/ MLRepository.html]. Irvine, CA: U. of California, Dept. of Information & Computer Science.