loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007)
Spam Classification Using Adaptive Boosting Algorithm
Melbourne, Australia
July 11-July 13
ISBN: 0-7695-2841-4
A. B. M. Shawkat Ali, Central Queensland University, Australia
Yang Xiang, Central Queensland University, Australia
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.
Index Terms:
Spam, filtering, Boosting algorithm.
Citation:
A. B. M. Shawkat Ali, Yang Xiang, "Spam Classification Using Adaptive Boosting Algorithm," icis, pp.972-976, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.