The synergy between PAV and AdaBoost

Machine Learning

Volumn 61, Issue 1-3, 2005, Pages 71-103

  Wilbur, W John ^a   Yeganova, Lana ^a   Kim, Won ^a  

^a NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

Boosting; Convergence; Document classification; Isotonic regression; K nearest neighbors

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; CLASSIFICATION (OF INFORMATION); PROBABILITY;

BOOSTING; CONVERGENCE; DOCUMENT CLASSIFICATION; ISOTONIC REGRESSION; K NEAREST NEIGHBORS;

INFORMATION ANALYSIS;

EID: 30044446212     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-005-1123-6     Document Type: Article

References (33)

1. Apte, C., Damerau, F., & Weiss, S. (1998). Text mining with decision rules and decision trees. Conference Proceedings The Conference on Automated Learning and Discovery, CMU.
2. Aslam, J. (2000). Improving algorithms for boosting. Conference Proceedings 13th COLT. Palo Alto, California.
3. Ayer, M., Brunk, H. D., Ewing, G. M., Reid, W. T., & Silverman, E. (1954). An empirical distribution function for sampling with incomplete information. Annals of Mathematical Statistics, 26, 641-647.
4. Bennett, K. P., Demiriz, A., & Shawe-Taylor, J. (2000). A column generation algorithm for boosting. Conference Proceedings 17th ICML.
5. Buja, A., Hastie, T., & Tibshirani, R. (1989). Linear smoothers and additive models. The Annals of Statistics, 17:2 453-555.
6. Burges, C. J. C. (1999). A tutorial on support vector machines for pattern recognition (Available electronically from the author): Bell Laboratories, Lucent Technologies.
7. Carreras, X., & Marquez, L. (2001). September 5-7, 2001. Boosting trees for anti-spam email filtering. Conference Proceedings RANLP2001, Tzigov Chark, Bulgaria.
8. Collins, M., Schapire, R. E., & Singer, Y. (2002). Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48:1, 253-285.
9. Duda, R. O., Hart, P. E., & Stork, D. G. (2000). Pattern Classification (2 edn.). New York: John Wiley & Sons, Inc.
10. Duffy, N., & Helmbold, D. (1999). Potential boosters? Conference Proceedings Advances in Neural Information Processing Systems 11.
11. Duffy, N., & Helmbold, D. (2000). Leveraging for regression. Conference Proceedings 13th Annual Conference on Computational Learning Theory. San Francisco.
12. Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal or Computer and System Sciences, 55:1, 119-139.
13. Friedman, J., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: A statistical view of boosting. The Annals of Statistics, 38:2, 337-374.
14. Hardle, W. (1991). Smoothing Techniques: With Implementation in S. New York: Springer-Verlag.
15. Johnson, M., Geman, S., Canon, S., Chi, Z., & Riezler, S. (1999). Estimators for stochastic "unification-based" grammars. Conference Proceedings Proceedings ACL'99. Univ. Maryland.
16. Kim, W., Aronson, A. R., & Wilbur, W. J. (2001). Automatic MeSH term assignment and quality assessment. Conference Proceedings Proc. AMIA Symp. Washington, D.C.
17. Kim, W. G., & Wilbur, W J. (2001). Corpus-based statistical screening for content-bearing terms. Journal of the American Society for Information Science, 52:3, 247-259.
18. Langley, P., & Sage, S. (1994). Induction of selective Bayesian classifiers. Conference Proceedings Tenth Conference on Uncertainty in Artificial Intelligence, Seattle, WA.
19. Maclin, R. (1998). Boosting classifiers locally. Conference Proceedings Proceedings of AAAI.
20. Mason, L., Bartlett, P. L., & Baxter, J. (2000). Improved generalizations through explicit optimizations of margins. Machine Learning, 38, 243-255.
21. McCallum, A., & Nigam, K. (1998). A comparison of event models for naive bayes text classification. Conference Proceedings AAAI-98 Workshop on Learning for Text Categorization.
22. Meir, R., El-Yaniv, R., & Ben-David, S. 2000. Localized boosting. Conference Proceedings 13th COLT. Palo Alto, California.
23. Mitchell, T. M. (1997). Machine learning. Boston: WCB/McGraw-Hill.
24. Moerland, P., & Mayoraz, E. (1999). DynamBoost: combining boosted hypotheses in a dynamic way (Technical Report RR 99-09): IDIAP Switzerland.
25. Nock, R., & Sebban, M. (2001). A Bayesian boosting theorem. Pattern Recognition Letters, 22, 413-419.
26. Pardalos, P. M., & Xue, G. (1999). Algorithms for a class of isotonic regression problems. Algorithmica, 23, 211-222.
27. Ratsch, G., Mika, S., & Warmuth, M. K. (2001). On the Convergence of Leveraging (NeuroCOLT2 Technical Report 98). London: Royal Holloway College.
28. Ratsch, G., Onoda, T., & Muller, K.-R. (2001). Soft margins for AdaBoost. Machine Learning, 42, 287-320.
29. Robertson, S. E., & Walker, S. (1994). Some simple effective approximations to the 2-Poisson model for probabilistic weighted retrieval. Conference Proceedings 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval.
30. Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37:3, 297-336.
31. Vapnik, V. (1998). Statistical Learning Theory. New York: John Wiley & Sons, Inc.
32. Witten, I. H., Moffat, A., & Bell, T. C. (1999). Managing Gigabytes (2 edn.). San Francisco: Morgan-Kaufmann Publishers, Inc.
33. Zhang, T., & Oles, F. J. (2001). Text categorization based on regularized linear classification methods. Information Retrieval, 4:1, 5-31.