Boosting Trees for Anti-Spam Email Filtering

2001/09/13 by Xavier Carreras, Lluis Marquez · 1 citation
Computer Science · #cs.CL

paper · pdf

published as Proceedings of RANLP-2001, pp. 58-64, Bulgaria, 2001 · 7 pages, 13 figures

arxiv created 2001/09/13 · arxiv updated 2009/11/30

Abstract

This paper describes a set of comparative experiments for the problem of automatically filtering unwanted electronic mail messages. Several variants of the AdaBoost algorithm with confidence-rated predictions [Schapire & Singer, 99] have been applied, which differ in the complexity of the base learners considered. Two main conclusions can be drawn from our experiments: a) The boosting-based methods clearly outperform the baseline learning algorithms (Naive Bayes and Induction of Decision Trees) on the PU1 corpus, achieving very high levels of the F1 measure; b) Increasing the complexity of the base learners allows to obtain better ``high-precision'' classifiers, which is a very important issue when misclassification costs are considered.

Cited by

• Improving Phishing Email Detection Performance of Small Large Language Models

Related

• Learning to Filter Spam E-Mail: A Comparison of a Naive Bayesian and a Memory-Based Approach
• An Experimental Comparison of Naive Bayesian and Keyword-Based Anti-Spam Filtering with Personal E-mail Messages
• Stacking classifiers for anti-spam filtering of e-mail
• Classification of Spam Emails through Hierarchical Clustering and Supervised Learning
• Building an Effective Email Spam Classification Model with spaCy