Boosting Trees for Anti-Spam Email Filtering

Details Boosting Trees for Anti-Spam Email Filtering Boosting Trees for Anti-Spam Email Filtering

2001-09-13

arxiv.org/abs/cs/0109015v1

Proceedings of RANLP-2001, pp. 58-64, Bulgaria, 2001

Computer Science

Computation and Language

7 pages, 13 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Boosting Trees for Anti-Spam Email Filtering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Boosting Trees for Anti-Spam Email Filtering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boosting Trees for Anti-Spam Email Filtering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540653