A Study of Machine Learning Algorithms on Email Spam Classification

10 pages•Published: March 9, 2020

Abstract

Despite the fact that different techniques have been developed to filter spam, due to the spammer’s rapid adoption of new spam detection techniques, we are still overwhelmed with spam emails. Currently, machine learning techniques are the most effective ways to classify and filter spam emails. In this paper, a comprehensive comparison and analysis of the performance of various classification models on the 2007 TREC Public Spam Corpus are exhibited in various cases of without or with N- Grams as well as using separate or combined datasets. It is shown that the inclusion of the N-Grams in the pre-processing phase provides high accuracy results for classification models in most of the cases, and the models using the split approach with combined datasets give better results than models using the separate dataset.

Keyphrases: classification, email spam, machine learning

In: Gordon Lee and Ying Jin (editors). Proceedings of 35th International Conference on Computers and Their Applications, vol 69, pages 170-179.

Links:	https://easychair.org/publications/paper/Jvsw
	https://doi.org/10.29007/qshd

BibTeX entry

@inproceedings{CATA2020:Study_Machine_Learning_Algorithms,
  author    = {N Sutta and Z Liu and X Zhang},
  title     = {A Study of Machine Learning Algorithms  on Email Spam Classification},
  booktitle = {Proceedings of 35th International Conference on Computers and Their Applications},
  editor    = {Gordon Lee and Ying Jin},
  series    = {EPiC Series in Computing},
  volume    = {69},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Jvsw},
  doi       = {10.29007/qshd},
  pages     = {170-179},
  year      = {2020}}

Download PDF Open PDF in browser