Asymmetric gradient boosting with application to spam filtering

4th Conference on Email and Anti-Spam, CEAS 2007

Volumn , Issue , 2007, Pages

  He, Jingrui ^a   Thiesson, Bo ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC MAIL;

BOOSTING METHOD; DIFFERENT CLASS; E-MAIL SPAM; FALSE POSITIVE; GRADIENT BOOSTING; OVERALL ACCURACIES; SPAM FILTERING; STATE-OF-THE-ART TECHNIQUES;

INTERNET;

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

References (11)

1. Androutsopoulos, I., Paliouras, G., & Michelakis, E. (2004). Learning to filter unsolicited commercial e-mail (Techni-cal Report 2004/2). National Centre for Scientific Re-search "Demokritos".
2. Carreras, X., & Márquez, L. (2001). Boosting trees for anti-spam email filtering. Proceedings of RANLP-01, 4th International Conference on Recent Advances in Natural Language Processing. Tzigov Chark, BG.
3. Collins, M., Schapire, R. E., & Singer, Y. (2000). Logistic re-gression, adaboost and bregman distances. Proceedings of Thirteenthth Annual Conference on Computational Learing Theory (pp. 158-169).
4. Fan, W., Stolfo, S. J., Zhang, J., & Chan, P. K. (1999). AdaCost: misclassification cost-sensitive boosting. Proceedings of the Sixteenth International Conference on Machine Learning (pp. 97{105). Morgan Kaufmann.
5. Freund, Y., & Schapire, R. (1997). A decision-theoretic generalization of on-line learning and application to boosting. Journal of Computer and System Sciences, 55, 119-139.
6. Friedman, J. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29, 1189-1232.
7. Friedman, J., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: a statistical view of boosting. Annals of Statistics, 28, 337-407.
8. Mason, L., Baxter, J., Bartlett, P., & Frean, M. (1999). Boosting algorithms as gradient descent in function space (Technical Report). RSISE, Australian National University.
9. Rudin, C. (2006). Ranking with a p-norm push. Proceedings of the Nineteenth Annual Conference on Computational Learning Theory (pp. 589-604).
10. Viola, P., & Jones, M. (2002). Fast and robust classification using asymmetric AdaBoost and a detector cascade. Advances in Neural Information Processing Systems 14. MIT Press, Cambridge, MA.
11. Yih, W., Goodman, J., & Hulten, G. (2006). Learning at low false positive rates. Proceedings of the Third Conference on Email and Anti-Spam.