\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={A Survey of Existing E-Mail Spam Filtering Methods Considering Machine Learning Techniques},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2018 2018-01-15 (revised: 29 Year 2018 15 January 2018)}
\def\TheID{\makeatother }
\def\TheDate{2018 2018-01-15}
\title{A Survey of Existing E-Mail Spam Filtering Methods Considering Machine Learning Techniques}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Jinat  Ara}

             \affil[1]{  Southeast University}

\renewcommand\Authands{ and }

\date{\small \em Received: 15 December 2017 Accepted: 4 January 2018 Published: 15 January 2018}

\maketitle


\begin{abstract}
        


E-mail is one of the most secure medium for online communication and transferring data or messages through the web. An overgrowing increase in popularity, the number of unsolicited data has also increased rapidly. To filtering data, different approaches exist which automatically detect and remove these untenable messages. There are several numbers of email spam filtering technique such as Knowledge-based technique, Clustering techniques, Learningbased technique, Heuristic processes and so on. This paper illustrates a survey of different existing email spam filtering system regarding Machine Learning Technique (MLT) such as Naive Bayes, SVM, K-Nearest Neighbor, Bayes Additive Regression, KNN Tree, and rules. However, here we present the classification, evaluation and comparison of different email spam filtering system and summarize the overall scenario regarding accuracy rate of different existing approaches

\end{abstract}


\keywords{e-mail spam; unsolicited bulk email; spam filtering methods; machine learning; algorithm.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
n recent years, internet has been created several platforms for making human life become more secure. Among these; e-mail is a substantial platform for user communication. Email is nothing; simply it's called an electronic messaging framework which transmits the message from one user to another \hyperref[b0]{[1]}. Nowadays, e-mail has turned into a typical medium \hyperref[b1]{[2]} because of its several branches like Yahoo mail \hyperref[b2]{[3]}, Gmail \hyperref[b3]{[4]}, Outlook \hyperref[b4]{[5]} etc, which are completely free for all web user by following some administration \hyperref[b5]{[6,}\hyperref[b6]{7]}. At present, Email called a secure worldwide communication medium for its several functions. But sometimes email becomes more hazardous for some "Spam Email".\par
Generally, Spam email called as junk email or unsolicited message which sent by spammer through Email. The process is, collected the address on the web and sends the message through domain's username. Actually, it has been produced for financial profits using I the assortment of procedures \hyperref[b7]{[8]} and instruments that incorporate spoofing, bonnets, open intermediaries, mail transfers, bulk mail instruments called mailers, and so forth. Spam filtering is a challenging undertaking for an assortment of reasons. For spam email, users are facing several problems like abuse of traffic, limit the storage space, computational power, become a barrier for finding the additional email, waste users time and also threat for user security \hyperref[b8]{[9,}\hyperref[b9]{10]}. So, becoming email more secure and effective, appropriate Email filtering is essential.\par
Several types of researches have been performed on email filtering, some acquired good accuracy and some are still going on. According to researcher's overview, Email filtering is a process to sort email according to some criteria. As there are various methods exist for email filtering, among them, inbound and outbound filtering is well known. Inbound filtering is the process to read a message from internet address and outbound filtering is to read the message from the local user. Moreover, the most effective and useful email filtering is Spam filtering which performs through antispam technique. As spammers are proactive natures and using dynamic spam structures which have been changing continuously for preventing the anti-spam procedures and thus making spam filtering is a challenging task \hyperref[b8]{[9,}\hyperref[b9]{10]}.\par
Spam filtering is a process to detect unsolicited massage and prevent from entering into user's inbox. Now days, various systems have been existed to generate anti-spam technique for preventing unsolicited bulk email. Most of the anti-spam methods have some inconsistency between false negatives (missed spam) and false positives (rejecting good emails) which act as a barrier for most of the system to make successful antispam system. Therefore, an intelligent and effective spam-filtering system is the prime demand for web users.\par
Among various approach, Fiaidhi et al. \hyperref[b10]{[11]} and Arora et al. \hyperref[b11]{[12]} proposed method evaluate that, 70\% today's business email's are spam \hyperref[b12]{[13]}. Spam filtering has two major section; "Knowledge engineering" and "Machine learning". Knowledge engineering is an arrangement of guidelines to determine the spam a) Standard Spam Filtering Method Email Spam filtering process works through a set of protocols to determine either the message is spam or not. At present, a large number of spam filtering process have existed. Among them, Standard spam filtering process follows some rules and acts as a classifier with sets of protocols. Figure  {\ref .}1 shows that, a standard spam filtering process performed the analysis by following some steps \hyperref[b13]{[14]}. First one is content filters which determine the spam message by applying several Machines learning techniques \hyperref[b7]{[8,}\hyperref[b9]{10,}\hyperref[b14]{[15]}\hyperref[b15]{[16]}\hyperref[b16]{[17]}\hyperref[b17]{[18]}. Second, header filters act by extracting information from email header. Then, backlist filters determine the spam message and stop all emails which come from backlist file. Afterward, "Rules-based filters" recognize sender through subject line by using user defined criteria \hyperref[b18]{[19]}. Next, "Permission filters" send the message by getting recipients pre-approvement. Finally, "Challengeresponse filter" performed by applying an algorithm for getting the permission from the sender to send the mail. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XVIII Issue II Version I  
\section[{II. Several Email Spam Filtering Methods}]{II. Several Email Spam Filtering Methods}\par
At present, number of spam email has increased for several criteria such as an advertisement, multi-level marketing, chain letter, political email, stock market advice and so forth. For restricting spam email, several methods or spam filtering system has been constructed by using various concept and algorithms. This section concluded by describing few of spam filtering methods to understand the process of spam filtering and its effectiveness. Enterprise level spam filtering is a process where provided frameworks are installing on mail server which interacts with the MTA for classifying the received messages or mail in order to categorize the spam message on the network. By this system, a user on that network can filter the spam by installing appropriate system \hyperref[b20]{[21,}\hyperref[b21]{22]} more efficiently. By far most; current spam filtering frameworks use principle based scoring procedures. An arrangement of guidelines is connected to a message and calculate a score based principles that are valid for the message. The message will consider as spam message when it exceeds the threshold value. As spammers are using various strategies, so all functions are redesigned routinely by applying a list-based technique to automatically block the messages. Figure \hyperref[fig_1]{2} represents the method of client side and enterprise level spam filtering \hyperref[b6]{[7]}.  At the first step, extracted all email (spam email and legitimate email) from individual users email through collection model. Then, the initial transformation starts with the pre-processing steps through client interface, highlight extraction and choice, email data classification, analyzing the process and by using vector expression classifies the data into two sets.\par
Finally, machine learning technique is applied on training sets and testing sets to determine email whether it is spam or legitimate. The final decision makes through two steps; through self observation and classifier's result to make decision whether the email is spam or legitimate. 
\section[{III. Overview of Several Existing Email Spam Filtering Systems for Machine Learning Technique}]{III. Overview of Several Existing Email Spam Filtering Systems for Machine Learning Technique}\par
Mohammed et al. \hyperref[b1]{[2]} [2013] proposed an approach for Classifying Unsolicited Bulk Email (UBE) using Python Machine Learning Techniques with the help of spam filtering which performs the work by creating a spam-ham dictionary from the given training data and applying data mining algorithm to filter the training and testing data.\par
After applying various classifier on1431 dataset, the approach predicts that, Naïve Bays and SVM classifiers are the prominent classifier for spam filtering or classification.\par
Subramaniam et al. \hyperref[b22]{[23]} [2012] implemented Naïve Bayesian Anti-spam Filtering Technique on Malay Language to investigate the utilization of Naïve Bayesian procedure to combat spam issue. An experiment conducted through Naïve Bayesian method for filtering Malay language spam and the result depicts that, propose approach has gained 69\% accuracy. They realized that by reducing false positive and expanding training corpus the result would much better for classifying Malay language spam. Banday et al. \hyperref[b24]{[25]} [2008] discuss the procedures of statistical spam filters design by incorporating Naïve Bayes, KNN, SVM, and Bayes Additive Regression Tree. Here evaluates these procedures in terms of accuracy, recall, precision, etc. Though all machine learning classifiers are effective but according to this approach, CBART and NB classifiers has better capability to spam filtering. This approach estimates that during spam filtering calculations of false positive are more costly than false negative.\par
Awad et al. \hyperref[b0]{[1]} [2011] proposed an ML-based approach on for Spam E-mail Classification. In this article present the most prominent machine learning strategies and its effectiveness regarding spam email classification. Here introduced Portrayals algorithms and the performance of Spam Assassin corpus. The result shows that, Naïve bays and rough sets methods are the promising algorithms for email classification. They perform their future research to improve the Nave Bays and Artificial immune system by hybrid system or by resolution the feature reliance issue .\par
Chhabra et al. \hyperref[b25]{[26]} [2010] developed Spam Filtering using Support Vector Machine by considering Nonlinear SVM classifier with different kernel functions over Enron Dataset. Here considered six datasets and perform the analysis of datasets having diverse spam: ham ratio and makes satisfactory Recall and Precision Value.\par
Tretyakov et al. \hyperref[b26]{[27]} [2004] discussed Machine Learning Techniques through Spam Filtering. In this article compared the precision between before eliminating false positive and after eliminating false positive. They represent the result that the result becomes more reliable considering both precision results (before eliminating and after eliminating false positive) either taking one.\par
Shahi et al. \hyperref[b27]{[28]} [2013] developed Mobile SMS Spam Filtering for Nepali Text Using Naïve Bayesian and Support Vector Machine. The fundamental concern of this study was to look at the effectiveness of Naïve Bayesian and SVM Spam filters. The correlation of productivity between these Spam filters was done based Suganya et al. \hyperref[b29]{[30]} [2014] worked on short message and misspelling of data on online Social Networks (OSNs) user post. They used machine learning technique with content-based features for short message and Filtered Wall (FW) \hyperref[b30]{[31]} to evaluate a system for filtering spam massage. They categorized the classification process into two levels; first-level classifier performs on Neutral and Non-neutral through hard binary categorization and second level classifier performs through RBFN model \hyperref[b31]{[32]}.\par
Rathi et al. \hyperref[b32]{[33]} [2013] proposed an approach using Data mining technique for finding the best classifier for email classification. They analyzed various data mining technique for measuring the performance of several classifiers through "with feature selection algorithm" and "without feature selection algorithm". After selecting the Best feature selection algorithm, they considered the selected algorithm for their feature selection purpose. They experiment their data by using several algorithms such as Naïve Bayes, Bayes Net, Support vector machine, and Function tree, J48, Random Forest and Random Tree. The whole dataset consists of 58 attributes and 4601 instances. Considering Random Tree algorithm highest accuracy was 99.72\% and the lowest accuracy was 78.94\% for Naïve Bayes algorithm.\par
Mohammed et al. \hyperref[b10]{[11]} [2013] presents an approach for filtering spam email using machine learning algorithms. At first, they filter Spam and Ham word from the training datasets by applying tokenization method based on these token create the testing and training table using various data mining algorithm. Then find the frequency of spam and ham tokens for measuring the probability which is suggested by Paul Graham \hyperref[b33]{[34]}. For ham token, the probability value was 0 and for spam token probability value was 1. They used Nielson Email-1431 \hyperref[b34]{[35]} dataset and emphasized that the Naïve Bayes and Support Vector Machine are the most effective classifier.\par
Singh et al. \hyperref[b35]{[36]} [2018] discussed the solution and classification process of spam filtering and presented a combining classification technique to get better spam filtering result. With the help of Data mining, they collected all the information of previous failures, success and current problems of spam filtering. In this method, researchers used binary value where 1 for spam email and 0 for not spam emails. But its success rate was very poor. So they apply NB, KNN, SVM, Artificial Neural Network classification method and find their accuracy. Based on these two techniques (machine learning and knowledge engineering) effectiveness, they adopt a classification technique for spam filtering. Moreover, here first collect data from user training set, compared and find the spam email and then use a global training set to optimize the classification technique. Using this technique increases the precision rate at least 2\%.\par
Abdulhamid et al. \hyperref[b36]{[37]} [2018] introduced a performance analysis based approach by using some classification techniques such as Bayesian Logistic Regression, Hidden Naïve Bayes, Logit Boost, Rotation Forest, NNge, Logistic Model Tree, REP Tree, Naïve Bayes, Radial Basis Function (RBF) Network, Voted Perceptron, Lazy Bayesian Rule, Multilayer Perceptron, Random Tree and J48. The competence of these techniques classified through Accuracy, Precision, Recall, F-Measure, Root Mean Squared Error, Receiver Operator Characteristics Area and Root Relative Squared Error using Spam base dataset and WEKA data mining tool. For conducting the performance and comparison, datasets are considered from UCI Machine Learning Repository. Considering Rotation Forest algorithm acquired the highest accuracy was 0.942 and the REP Tree algorithm showed the lowest accuracy was 0.891. They applied the F-measure method for finding precision and recall. The highest F-measure considered from Rotation forest algorithm and lowest Fmeasure considered from Naïve Bayes algorithm. For finding the probability use ROC curves on randomly selected positive and negative instance and for Rotation forest algorithm the ROC curves carried the highest score was 0.98. In contrast, Random Tree having the lowest score which was 0.905. For finding the statistics result, they use kappa Statistics and the result was much better for Rotation Forest algorithm which approximately 0.879. This paper showed that, Rotation Forest classifier gained the best result with 0.942 accuracies, then J48 with 0.923, Naïve Bayes with 0.885 and Multilayer Perception with 0.932.\par
Sah et al. \hyperref[b38]{[38]} [2017] proposed a method for detecting of malicious spam through feature selection and improve the training time and accuracy of malicious spam detection system. They also showed the comparison of difference classifier as Naïve Bayes (NB) and Support Vector Machine (SVM) based on accuracy and computation time. to the approach, Naïve Bayes selected as good classifiers among others.\par
Rusland et al. \hyperref[b40]{[40]} [2017] perform the analysis using Naïve Bayes algorithm for email spam filtering on two datasets which are evaluated based on the accuracy, recall, precision and F-measure. Naïve Bayes algorithm is a probability-based classifier and the probability is counting the frequency and combination of values in a dataset. This research performed through three phases such as pre-processing, Feature Selection, and implementation through Naïve Bayes Classifier. First they remove all conjunction words, articles from the email body in pre-processing section. Made two datasets through WEKA tool; one is a Spam Data and another is the SpamBase dataset. The average accuracy was 8.59\% by considering two datasets where Spam data get 91.13\% and the SpamBase data get 82.54\% accuracy. The average precision for SpamBase was 88\% and for Spam data was 83\%. They proposed that, Naïve Bayes classifier performs better on SpamBase data compared with Spam Data.\par
Yuksel et al. \hyperref[b41]{[41]} [2017] use Support Vector Machine and Decision tree for spam filtering. The Decision tree used in data mining and the support vector machines as a supervised learning model which can analyze the data for spam classification. First data was divided into two sections; one is training and other is test data, then the algorithm was trained and evaluated through Microsoft Azure platform which provides tools for machine learning and compared results with decision tree and support vector machine algorithm. The result of SVM method was 97.6\% and for Decision tree the result was 82.6\%. The result estimate that, SVM classifier performed better than DT.\par
Choudhary et al. \hyperref[b42]{[42]} [2017] presented a novel approach using machine learning classification algorithm for finding and classifying SMS spam by using Short Message Service (SMS). The first step in this approach is feature selection and for that, they work on presence of mathematical symbols: UGLs, Dots, special symbols, emotions, Lowercased words and Uppercased words, mobile number, keyword specific and the message length in the SMS. After that they created a system design and collected a dataset which contained 2608 emails out of 2408 collected SNS Spam Corpus. The SMS Spam Corpus v.0.1 consists two sets of messages as SMS Spam Corpus v.0.1 Small and SMS Spam Corpus v.0.1 Big. Using "WEKA tools" for five machine learning approaches; such as Naive Bayes, Logistic Regression, J48, Decision Tree and Random Forest. Evaluating result uses with True Positive Rate (TP) and True Negative Rate (TN). False Positive Rate (FP), False Negative Rate (FN), Precision, Recall, Fmeasure and Receiver Operating Characteristics (ROC) area achieved 96.5\% true positive rate and 1.02\% false positive rate with Random Forest machine learning algorithm and it performs better algorithm with high rate accuracy.\par
DeBarr et al. \hyperref[b43]{[43]} [2009] use Random Forest algorithms for classification of spam email then refining the classification model using active learning. They take data from RFC 822(Internet) email message and divided each email into two sections and converted each message to term frequency and inverse document frequency (TF/IDF) features. Here select an initial set of email message using clustering technique to label as training examples and for clustering used Partitioning Around Medoids (PAM) algorithm. After considering the cluster prototype messages for training they experiment with some algorithm Random Forest, Naive Bayes, SVM and kNN. Here Random Forest algorithm performs the best classifier with 95.2\% accuracy. 
\section[{IV. Summary of Existing E-mail Spam Classification Approaches}]{IV. Summary of Existing E-mail Spam Classification Approaches}\par
Since last few decades, researchers are trying to make email as a secure medium. Spam filtering is one of the core features to secure email platform. Regarding this several types of research have been progressed reportedly but still there are some untapped potentials. Over time, still now e-mail spam classification is one of the major areas of research to bridge the gaps. Therefore, a large number of researches already have been performed on email spam classification using several techniques to make email more efficient to the users. That's why, this paper tried to arrange the summarized version of various existing Machine Learning approaches. In addition, in order to evaluates the most of the approaches like Random Forest, Naive Bayes \hyperref[b10]{[11,}\hyperref[b22]{23,}\hyperref[b43]{43]}, SVM \hyperref[b7]{[8,}\hyperref[b9]{10,}\hyperref[b17]{18]}, kNN \hyperref[b26]{[27,}\hyperref[b35]{36]}, and Random Forest \hyperref[b14]{[15,}\hyperref[b15]{16]} used reliable and well known dataset for benchmarking performance such as SpamData \hyperref[b15]{[16]}, The Spam Assassin \hyperref[b44]{[44]}, The Spambase, Ecml-pkdd 2006 challenge dataset \hyperref[b45]{[45]}, PU corpora dataset \hyperref[b14]{[15]}, Enron dataset \hyperref[b46]{[46]},Trec 2005 dataset  {\ref [47]}. Some of these dataset are in a prepared structure e.g. ECML and data accessible in Spambase UCI archive \hyperref[b19]{[20]}. Among them, some of the classifiers also used novel methods applied in the feature selection for improving classification such as \hyperref[b0]{[1,}\hyperref[b10]{11]}.\par
Verma et al. \hyperref[b39]{[39]} [2017] proposed a method for spam detection using Support Vector Machine algorithm and feature extraction. This methodology works through several steps such as Email collections, preprocessing, feature extraction, SVM training, test classifier, top word predictors, test email and result. First they take a dataset from Apache Public corpus. In preprocessing section, they remove all special symbol, URL and HTML tags and also unnecessary alphabet. Then they mapped all word from the dictionary using Vocab file. SVM classifier applied on the training dataset. The Accuracy of the system was 98\%.  
\section[{Discussion}]{Discussion}\par
From the observation, it seems that, the majority of email spam filtering process performed through Machine learning technique using Naïve Bayes and SVM algorithm. Most of the approaches adopt different dataset such as "ECML" data and Spam base UCI archive \hyperref[b19]{[20]}. Among several papers, Mohammad et al. introduce a classifier for feature selection which regarded as the most novel classifier for feature selection \hyperref[b0]{[1,}\hyperref[b10]{11]}. Rathi et al proposed an approach considering "Naïve Bayes", "Bayes Net", "SVM" and "Random forest" algorithm and obtain the higher accuracy than others which approximately crossed 99.72\% accuracy \hyperref[b31]{[32]}. Another one is, Awad et al. which proposed an approach considering "Naïve Bayes", "SVM", "K-Nearest Neighbor", "Artificial neural Networks", "Rough sets" algorithm and obtain 99.46\% accuracy which seems good on their effectiveness \hyperref[b0]{[1]}. After the analysis it should predict that, "Naïve Bayes" and "SVM" algorithm is the most effective algorithm in machine learning technique and have the ability to better classification of email spam. 
\section[{VI.}]{VI.} 
\section[{Conclusion}]{Conclusion}\par
This survey paper elaborates different Existing Spam Filtering system through Machine learning techniques by exploring several methods, concluding the overview of several Spam Filtering techniques and summarizing the accuracy of different proposed approach regarding several parameters. Moreover, all the existing methods are effective for email spam filtering. Some have effective outcome and some are trying to implement another process for increasing their accuracy rate. Though all are effective but still now spam filtering system have some lacking which are the major concern for researchers and they are trying to generate next generation spam filtering process which have the ability to consider large number of multimedia data and filter the spam email more prominently.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :A}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 3 :}\end{figure}
  \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
( ) C\\
© 2018 Global Journals 1\end{longtable} \par
 
\caption{\label{tab_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{I} \par 
\begin{longtable}{P{0.03412535845964768\textwidth}P{0.05710774272839\textwidth}P{0.09784924211388775\textwidth}P{0.2615116755428103\textwidth}P{0.14520688242523558\textwidth}P{0.25419909873002866\textwidth}}
\tabcellsep \multicolumn{5}{l}{A Survey of Existing E-Mail Spam Filtering Methods Considering Machine Learning Techniques}\\
\tabcellsep \tabcellsep V.\tabcellsep \tabcellsep \tabcellsep \\
\tabcellsep Sr. No.\tabcellsep Author\tabcellsep Algorithms\tabcellsep Corpus or Datasets\tabcellsep Accuracy/ Performance\\
\tabcellsep 1\tabcellsep Mohammed et al.\tabcellsep Naive KNN,Decision Tree, Rules Bayes, SVM,\tabcellsep Email-1431\tabcellsep 85.96\% Accuracy Achieved\\
\tabcellsep 2\tabcellsep Subramaniam et al.\tabcellsep Naive Bayesian\tabcellsep Collection emails from Google's of spam Gmail Account\tabcellsep 96.00\% Accuracy Achieved\\
\tabcellsep 3\tabcellsep Sharma et al.\tabcellsep Various Machine Learning Algorithms Adaptions\tabcellsep SPAMBASE\tabcellsep 94.28\% Accuracy Achieved\\
Year 2018\tabcellsep 4\tabcellsep Banday et al.\tabcellsep Naive Bayes, K-Nearest Neighbor, SVM, classification Bayes Additive Regression Tree\tabcellsep Real life data set\tabcellsep 96.69\% Accuracy Achieved\\
26 Volume XVIII Issue II Version I C ( )\tabcellsep 5 6 7 8 9 10\tabcellsep Awad et al. Chhabra et al. Tretyakov Shahi et al. Kaul et al Suganya et al.\tabcellsep Naive Bayes, SVM, k-Nearest Neighbor, Artificial Neural Networks, Rough Sets Nonlinear SVM classifier. Bayesian classification, k-NN, ANNs, SVMs Naïve Bayes, SVM SVM Rule Baseed Method Naive Bayes, Bayes\tabcellsep Spam Assassin Enron dataset PU1 corpus Nepali SMS Sample emails Online Social Networks (OSNs) user post\tabcellsep 99.46\% Accuracy For Dataset 3, spam: real, the ratio is 1:3, for satisfactory Recall and Precision Values Achieved 94.4\% Accuracy Achieved 92.74\% Accuracy Achieved 90\% \textasciitilde  95\%Accuracy Achieved Excellence Accuracy for Given Datasets\\
Global Journal of Computer Science and Technology\tabcellsep 11 12 13 14 15 16 17 18\tabcellsep Rathi et al. Mohammed et al. Singh et al. Abdulhamid et al. Sah et al. Verma et al. Rusland et al. ksel et al.\tabcellsep Net,SVM, and Random Forest Word Filterization by Tokenization, Appling Naive Bayes, k-Nearest Neighbor, SVM, Artificial Neural Network. Various Machine Learning Algorithms Naïve Bayes, SVM Customised SVM Modified Naive Bayes withselective features Microsoft Azure platform defined decision tree and\tabcellsep Custom Collection Nielson Email-1431 Custom Collection UCI Machine Learning Repository \& Custom Collection Apache Public Corpus SpamBase, SpamData Custom Collection\tabcellsep 99.72\% Accuracy Rate Reported Satisfactory Accuracy for Proposed Method Reported Improvement of precision rate at least 2\% 94.2\% Accuracy Achieved Reported good Accuracy overall 98\% Accuracy Rate Reported SpamBase get 88\%Precision Rate and SpamData get 83\% SVM Accuracy 97.6\% Decision Tree\\
\tabcellsep \tabcellsep \tabcellsep SVM\tabcellsep \tabcellsep Accuracy 82.6\%\\
\tabcellsep 19\tabcellsep Choudhary et al.\tabcellsep Feature Engineered Naive Bayes\tabcellsep The SMS Spam Corpus v.0.1\tabcellsep 96.5\% True Positive Rate Accuracy\\
\tabcellsep 20\tabcellsep DeBarr et al.\tabcellsep Random Forest algorithm\tabcellsep Custom Collection\tabcellsep 95.2\% Accuracy\\
\tabcellsep © 2018 Global Journals 1\tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_2}Table I :}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Rahane et al.]{b30}\label{b30} 	 		\textit{},  		 			U Rahane 		,  		 			A Lande 		,  		 			O Bavikar 		,  		 			S Chavan 		,  		 			K N Shedge 		.  	 	 		\textit{International Journal of Engineering Sciences \& Research Technology Advanced Filtering System to Protect OSN user Wall From Unwanted Messages}  		 	 
\bibitem[Shafi'i Muhammad Abdulhamid et al. ()]{b36}\label{b36} 	 		\textit{},  		 			M S Shafi'i Muhammad Abdulhamid 		,  		 			O Osho 		,  		 			I Ismaila 		,  		 			J K Alhassan 		.  		2018.  	 
\bibitem[Sahami et al. (1998)]{b8}\label{b8} 	 		‘A Bayesian approach to filtering junk e-mail’.  		 			M Sahami 		,  		 			S Dumais 		,  		 			D Heckerman 		,  		 			E Horvitz 		.  	 	 		\textit{Learning for Text Categorization: Papers from the 1998 workshop},  				1998. July. 62 p. .  	 
\bibitem[Cunningham et al. (2003)]{b6}\label{b6} 	 		‘A case-based approach to spam filtering that can track concept drift’.  		 			P Cunningham 		,  		 			N Nowlan 		,  		 			S J Delany 		,  		 			M Haahr 		.  	 	 		\textit{The ICCBR},  				2003. May. 3 p. .  	 
\bibitem[Chen et al. (2011)]{b2}\label{b2} 	 		‘A first look at inter-data center traffic characteristics via yahoo!datasets’.  		 			Y Chen 		,  		 			S Jain 		,  		 			V K Adhikari 		,  		 			Z L Zhang 		,  		 			K Xu 		.  	 	 		\textit{INFOCOM, 2011 Proceedings IEEE},  				2011. April. IEEE. p. .  	 
\bibitem[Guzella and Caminhas ()]{b44}\label{b44} 	 		‘A review of machine learning approaches to spam filtering’.  		 			T S Guzella 		,  		 			W M Caminhas 		.  	 	 		\textit{Expert Systems with Applications}  		2009. 36  (7)  p. .  	 
\bibitem[Christina et al. ()]{b13}\label{b13} 	 		‘A study on email spam filtering techniques’.  		 			V Christina 		,  		 			S Karpagavalli 		,  		 			G Suganya 		.  	 	 		\textit{International Journal of Computer Applications}  		2010. 12  (1)  p. .  	 
\bibitem[Blanzieri and Bryl ()]{b5}\label{b5} 	 		‘A survey of learningbased techniques of email spam filtering’.  		 			E Blanzieri 		,  		 			A Bryl 		.  	 	 		\textit{Artificial Intelligence Review}  		2008. 29  (1)  p. .  	 
\bibitem[Saad et al. ()]{b1}\label{b1} 	 		‘A survey of machine learning techniques for Spam filtering’.  		 			O Saad 		,  		 			A Darwish 		,  		 			R Faraj 		.  	 	 		\textit{International Journal of Computer Science and Network Security (IJCSNS)}  		2012. 12  (2)  p. 66.  	 
\bibitem[Sharma and Arora ()]{b23}\label{b23} 	 		‘Adaptive approach for spam detection’.  		 			S Sharma 		,  		 			A Arora 		.  	 	 		\textit{International Journal of Computer Science Issues}  		2013. 10  (4)  p. .  	 
\bibitem[Sah and Parmar ()]{b38}\label{b38} 	 		\textit{An approach for Malicious Spam Detection in Email with comparison of different classifiers},  		 			U K Sah 		,  		 			N Parmar 		.  		2017.  	 
\bibitem[Androutsopoulos et al. ()]{b15}\label{b15} 	 		\textit{An evaluation of naive bayesian anti-spam filtering},  		 			I Androutsopoulos 		,  		 			J Koutsias 		,  		 			K V Chandrinos 		,  		 			G Paliouras 		,  		 			C D Spyropoulos 		.  		 cs/0006013.  		2000.  	 	 (arXiv preprint) 
\bibitem[Rusland et al. (2017)]{b40}\label{b40} 	 		‘Analysis of Naïve Bayes Algorithm for Email Spam Filtering across Multiple Datasets’.  		 			N F Rusland 		,  		 			N Wahid 		,  		 			S Kasim 		,  		 			H Hafit 		.  	 	 		\textit{IOP Conference Series: Materials Science and Engineering},  				2017. August. IOP Publishing. 226 p. 12091.  	 
\bibitem[Kang et al. (2005)]{b34}\label{b34} 	 		‘Categorization and keyword identification of unlabeled documents’.  		 			N Kang 		,  		 			C Domeniconi 		,  		 			D Barbará 		.  	 	 		\textit{Data Mining, Fifth IEEE International Conference on},  				2005. November. IEEE. p. 4.  	 
\bibitem[Comparative Analysis of Classification Algorithms for Email Spam Detection]{b37}\label{b37} 	 		\textit{Comparative Analysis of Classification Algorithms for Email Spam Detection},  		 	 
\bibitem[Yüksel et al. ()]{b41}\label{b41} 	 		‘Design of a Machine Learning Based Predictive Analytics System for Spam Problem’.  		 			A S Yüksel 		,  		 			S F Cankaya 		,  		 			? S Üncü 		.  	 	 		\textit{Acta Physica Polonica, A}  		2017.  (3)  p. 132.  	 
\bibitem[Suganya et al.]{b29}\label{b29} 	 		\textit{Detection of Spam in Online Social Networks (OSN) Through Rule-based System},  		 			T Suganya 		,  		 			K Sridevi 		,  		 			M Arulprakash 		.  		 	 
\bibitem[Verma ()]{b39}\label{b39} 	 		\textit{E-Mail Spam Detection and Classification Using SVM and Feature Extraction},  		 			T Verma 		.  		2017.  	 
\bibitem[Banday and Jan ()]{b24}\label{b24} 	 		\textit{Effectiveness and limitations of statistical spam filters},  		 			M T Banday 		,  		 			T R Jan 		.  		 arXiv:0910.2540.  		2009.  	 	 (arXiv preprint) 
\bibitem[Hidalgo (2002)]{b17}\label{b17} 	 		‘Evaluating costsensitive unsolicited bulk email categorization’.  		 			J M G Hidalgo 		.  	 	 		\textit{References In Proceedings of the 2002 ACM symposium on Applied computing},  				2002. March. ACM. p. .  	 
\bibitem[Moody and Darken ()]{b31}\label{b31} 	 		‘Fast learning in networks of locally-tuned processing units’.  		 			J Moody 		,  		 			C J Darken 		.  	 	 		\textit{Neural computation}  		1989. 1  (2)  p. .  	 
\bibitem[Graham ()]{b33}\label{b33} 	 		 			P Graham 		.  		 \url{http://www.paulgraham.com/spam.html}  		\textit{A plan for spam},  				2002.  	 
\bibitem[Fawcett ()]{b19}\label{b19} 	 		‘In vivo spam filtering: a challenge problem for KDD’.  		 			T Fawcett 		.  	 	 		\textit{ACM SIGKDD Explorations Newsletter}  		2003. 5  (2)  p. .  	 
\bibitem[Klimt and Yang (2004)]{b46}\label{b46} 	 		‘Introducing the Enron Corpus’.  		 			B Klimt 		,  		 			Y Yang 		.  	 	 		\textit{CEAS},  				2004. July.  	 
\bibitem[Androutsopoulos et al. ()]{b18}\label{b18} 	 		\textit{Learning to filter spam e-mail: A comparison of a naive bayesian and a memory-based approach},  		 			I Androutsopoulos 		,  		 			G Paliouras 		,  		 			V Karkaletsis 		,  		 			G Sakkis 		,  		 			C D Spyropoulos 		,  		 			P Stamatopoulos 		.  		 cs/0009009.  		2000.  	 	 (arXiv preprint) 
\bibitem[Barlow and Lane ()]{b3}\label{b3} 	 		‘Like technology from an advanced alien culture: Google apps for education at ASU’.  		 			K Barlow 		,  		 			J Lane 		.  	 	 		\textit{Proceedings of the 35th annual ACM SIGUCCS fall conference},  				 (the 35th annual ACM SIGUCCS fall conference)  		2007. ACM. p. .  	 	 (October)) 
\bibitem[Awad and Elseuofi ()]{b0}\label{b0} 	 		‘Machine Learning methods for E-mail Classification’.  		 			W A Awad 		,  		 			S M Elseuofi 		.  	 	 		\textit{International Journal of Computer Applications}  		2011.  (1)  p. 16.  	 
\bibitem[Tretyakov (2004)]{b26}\label{b26} 	 		‘Machine learning techniques in spam filtering’.  		 			K Tretyakov 		.  	 	 		\textit{Data Mining Problem-oriented Seminar, MTAT},  				2004. May. 3 p. .  	 
\bibitem[Metsis et al. (2006)]{b14}\label{b14} 	 		 			V Metsis 		,  		 			I Androutsopoulos 		,  		 			G Paliouras 		.  		\textit{Spam filtering with naive bayes-which naive bayes? In CEAS},  				2006. July. 17 p. .  	 
\bibitem[Shahi and Yadav ()]{b27}\label{b27} 	 		‘Mobile SMS spam filtering for Nepali text using naïve bayesian and support vector machine’.  		 			T B Shahi 		,  		 			A Yadav 		.  	 	 		\textit{International Journal of Intelligence Science}  		2013. 4  (01)  p. 24.  	 
\bibitem[Mohammed et al. ()]{b10}\label{b10} 	 		 			S Mohammed 		,  		 			O Mohammed 		,  		 			J Fiaidhi 		,  		 			S J Fong 		,  		 			T H Kim 		.  		\textit{Classifying Unsolicited Bulk Email (UBE) using Python Machine Learning Techniques},  				2013.  	 
\bibitem[Hovold (2005)]{b16}\label{b16} 	 		‘Naive Bayes Spam Filtering Using Word-Position-Based Attributes’.  		 			J Hovold 		.  	 	 		\textit{CEAS},  				2005. July. p. .  	 
\bibitem[Subramaniam et al. ()]{b22}\label{b22} 	 		‘Overview of textual anti-spam filtering techniques’.  		 			T Subramaniam 		,  		 			H A Jalab 		,  		 			A Y Taqa 		.  	 	 		\textit{International Journal of Physical Sciences}  		2010. 5  (12)  p. .  	 
\bibitem[Fisher et al. (2006)]{b4}\label{b4} 	 		‘Revisiting Whittaker \& Sidner's email overload ten years later’.  		 			D Fisher 		,  		 			A J Brush 		,  		 			E Gleave 		,  		 			M A Smith 		.  	 	 		\textit{Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work},  				 (the 2006 20th anniversary conference on Computer supported cooperative work)  		2006. November. ACM. p. .  	 
\bibitem[Debarr and Wechsler (2009)]{b43}\label{b43} 	 		‘Spam detection using clustering, random forests, and active learning’.  		 			D Debarr 		,  		 			H Wechsler 		.  	 	 		\textit{Sixth Conference on Email and Anti-Spam},  				 (Mountain View, California)  		2009. July. p. .  	 
\bibitem[Cormack et al. (2007)]{b21}\label{b21} 	 		‘Spam filtering for short messages’.  		 			G V Cormack 		,  		 			J M Hidalgo 		,  		 			E P Sánz 		.  	 	 		\textit{Proceedings of the sixteenth ACM conference on Conference on information and knowledge management},  				 (the sixteenth ACM conference on Conference on information and knowledge management)  		2007. November. ACM. p. .  	 
\bibitem[Chhabra et al. ()]{b25}\label{b25} 	 		‘Spam filtering using support vector machine’.  		 			P Chhabra 		,  		 			R Wadhvani 		,  		 			S Shukla 		.  	 	 		\textit{Special Issue IJCCT}  		2010. 1  (2)  p. 3.  	 
\bibitem[Rathi and Pareek ()]{b32}\label{b32} 	 		‘Spam mail detection through data mining-A comparative performance analysis’.  		 			M Rathi 		,  		 			V Pareek 		.  	 	 		\textit{International Journal of Modern Education and Computer Science}  		2013. 5  (12)  p. 31.  	 
\bibitem[Singh and Bhardwaj ()]{b35}\label{b35} 	 		‘Spam Mail Detection Using Classification Techniques and Global Training Set’.  		 			V K Singh 		,  		 			S Bhardwaj 		.  	 	 		\textit{Intelligent Computing and Information and Communication},  				2018. p. .  	 
\bibitem[Scholar ()]{b12}\label{b12} 	 		\textit{Supervised learning approach for spam classification analysis using data mining tools. organization},  		 			M Scholar 		.  		2010. 2 p. .  	 
\bibitem[Drucker et al. ()]{b7}\label{b7} 	 		‘Support vector machines for spam categorization’.  		 			H Drucker 		,  		 			D Wu 		,  		 			V N Vapnik 		.  	 	 		\textit{IEEE Transactions on Neural networks}  		1999. 10  (5)  p. .  	 
\bibitem[Drucker et al. ()]{b28}\label{b28} 	 		‘Support vector machines for spam categorization’.  		 			H Drucker 		,  		 			D Wu 		,  		 			V N Vapnik 		.  	 	 		\textit{IEEE Transactions on Neural networks}  		1999. 10  (5)  p. .  	 
\bibitem[Wang et al. ()]{b9}\label{b9} 	 		‘SVM-Based Spam Filter with Active and Online Learning’.  		 			Q Wang 		,  		 			Y Guan 		,  		 			X Wang 		.  	 	 		\textit{TREC},  				2006.  	 
\bibitem[Harisinghaney et al. (2014)]{b11}\label{b11} 	 		‘Text and image based spam email classification using KNN, Naïve Bayes and Reverse DBSCAN algorithm’.  		 			A Harisinghaney 		,  		 			A Dixit 		,  		 			S Gupta 		,  		 			A Arora 		.  	 	 		\textit{Optimization, Reliabilty, and Information Technology (ICROIT), 2014 International Conference on},  				2014. February. IEEE. p. .  	 
\bibitem[Choudhary and Jain ()]{b42}\label{b42} 	 		‘Towards Filtering of SMS Spam Messages Using Machine Learning Based Technique’.  		 			N Choudhary 		,  		 			A K Jain 		.  	 	 		\textit{Advanced Informatics for Computing Research},  				 (Singapore)  		2017. Springer. p. .  	 
\bibitem[Mavroeidis et al. ()]{b45}\label{b45} 	 		‘Using tri-training and support vector machines for addressing the ECML/PKDD 2006 discovery challenge’.  		 			D Mavroeidis 		,  		 			K Chaidos 		,  		 			S Pirillos 		,  		 			D Christopoulos 		,  		 			M Vazirgiannis 		.  	 	 		\textit{Proceedings of ECMLPKDD 2006 Discovery Challenge Workshop},  				 (ECMLPKDD 2006 Discovery Challenge Workshop)  		2006. p. .  	 
\bibitem[Wu et al. (2005)]{b20}\label{b20} 	 		‘Using visual features for anti-spam filtering’.  		 			C T Wu 		,  		 			K T Cheng 		,  		 			Q Zhu 		,  		 			Y L Wu 		.  	 	 		\textit{ICIP 2005. IEEE International Conference on},  				2005. September. 2005. IEEE. 3 p. 509.  	 	 (Image Processing) 
\end{bibitemlist}
 			 		 	 
\end{document}
