Spam Classification Using Adaptive Boosting Algorithm

Spam is no doubt a new and growing threat to the Internet and its end users. This paper investigates current approaches for blocking spam and proposes a new spam classification method by using adaptive boosting algorithm. Experiment is carried out to evaluate the results of spam filtering. We find adaptive boosting algorithm is an effective approach to solve the spam problem. We also find that default method in WEKA such as DecisionStump is not actually the best associated algorithm to filter spam. After comparing DecisionStump, J48, and NaiveBayes we conclude J48 is the most suitable associated algorithm to filter spam with high true positive rate, low false positive rate and low computation time.