\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={Comparative Analysis of Selected Filtered Feature Rankers Evaluators for Cyber Attacks Detection},
 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{2021-07-26 (revised: 26 July 2021)}
\def\TheID{\makeatother }
\def\TheDate{2021-07-26}
\title{Comparative Analysis of Selected Filtered Feature Rankers Evaluators for Cyber Attacks Detection}
\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]{Olasehinde  Olayemi}

\renewcommand\Authands{ and }

\date{\small \em Received: 24 June 2021 Accepted: 14 July 2021 Published: 26 July 2021}

\maketitle


\begin{abstract}
        


An increase in global connectivity and rapid expansion of computer usage and computer networks has made the security of the computer system an important issue; with the industries and cyber communities being faced with new kinds of attacks daily. The high complexity of cyberattacks poses a great challenge to the protection of cyberinfrastructures, Confidentiality, Integrity, and availability of sensitive information stored on it. Intrusion detection systems monitors? network traffic for suspicious (Intrusive) activity and issues alert when such activity is detected. Building Intrusion detection system that is computationally efficient and effective requires the use of relevant features of the network traffics (packets) identified by feature selection algorithms. This paper implemented K-Nearest Neighbor and Naïve Bayes Intrusion detection models using relevant features of the UNSW-NB15 Intrusion detection dataset selected by Gain Ratio, Information Gain, Relief F and Correlation rankers feature selection techniques.

\end{abstract}


\keywords{features rankers, cyber-attacks, intrusion, classification, computer security, network packets.}

\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[{I. Introduction}]{I. Introduction}\par
he increase in global connectivity and rapid expansion of computer usage and computer networks has made the security of the computer system an important issue; with the industries and cyber communities being faced with new kinds of attacks daily. The high complexity of intrusion poses a great challenge to the protection of cyberinfrastructure and the Confidentiality, integrity, and availability of sensitive information stored on them. The state of computer security is complicated, it is difficult to have a system that is completely free from attacks. The nature and the means of executing cyberattacks make it prevalent. Cyber-attacks are easy and cheap to execute, all that is require to stage a cyber-attacks are computer system and internet access, the nature of internet makes\par
Author: e-mail: olaolasehinde@fedpolel.edu.ng\par
The objectives of feature-ranking are threefolds: improving the prediction performance of the predictors, providing faster and more cost-effective predictors, and providing a better understanding of the underlying process that generated the dataset \hyperref[b2]{[3]}. The FS also reduces the computational time to implement an online Network Intrusion Detection System (NIDS) \hyperref[b3]{[4]}. The efficiency of the FS methods is measured by its accuracy at removing noisy and redundant features \hyperref[b17]{[5]}. The quality of the network traffics /dataset does not only help to build effective NIDS but also shows its potential Year 2022 launching a cyber-attack is less risky than physical attacks, and not constrained by geographical distance. \hyperref[b0]{[1]}. Network traffics contain different types of protocols and services which accounted for the multiple features in the network packet. Some of these features are redundant or irrelevant and does not contribute the classification of the network packets as either attack or normal network packets. The redundant features are the primary causes of increasing the false alarm rate (FAR) and decrease in detection accuracy. Feature Selection (FS) Techniques are the methods used to determine the relevant features of a dataset. It is an efficient way to reduce the dimensionality of a problem \hyperref[b1]{[2]}. Different FS techniques existed in classification and clustering problems. They are i) Filter method ii) Wrapper Method and iii) Embedded method. The filter methods are used to select the features based on the scores in various statistical correlations. Wrapper method uses a greedy approach in feature selection. It evaluates all possible combination and produces the result for Machine learning. The embedded method combines the advantage of two models. Filtered Feature selection algorithms can be grouped into two categories from the point of view of a method's output: feature-ranking and feature-subset selection. Feature-subset selection focuses on selecting best subset of features that satisfies an evaluation criterion, feature-ranking on the other hand ranks features according to certain evaluation criterial, which measures the relevance of individual feature to the target class, and select the set of ranked features that gives the best evaluation performance, the drawback of this methods is that, a features that is not relevant to the target class on its own, can be very relevant when combined with others features.\par
efficiency during deployment in a real-life operating environment. NIDS analyze and monitor network traffic to detect suspicious activities and vulnerability in the system \hyperref[b4]{[6]}. The effectiveness of NIDS is evaluated based on its ability to correctly identify network traffics as attacks traffic or benign traffics (normal) in a comprehensive dataset that contains normal and abnormal behaviors \hyperref[b5]{[7]}.\par
Feature-ranking techniques ranked features independently without involving any learning algorithm based on statistics, information theory, or some functions of classifier's outputs \hyperref[b7]{[8]}. It consists of scoring each feature according to a particular evaluation criterion \hyperref[b8]{[9]}. Several authors have proposed various features selection methods. In the work of Wang and Gombault \hyperref[b8]{[9]}, IG and Chi-squared were applied to extract nine most important features from the forty one features to build Bayesian Network and C 4.5 decision tree classifiers to detect DDoS attack in the network. Results obtained shows that the detection accuracy remains the same while the overall efficiency improved. Authors in \hyperref[b9]{[10]} proposed a multi-filter feature selection techniques that combines the results four filter selections methods on NSL-KDD intrusion network dataset to achieve an optimum selection. C4.5 decision tree evaluation of the thirteen optimal selected features out of forty one features shows a high detection rate and classification accuracy when compared to the forty-one features and other classification techniques. \hyperref[b10]{[11]} Proposed a feature selection method based on Decision Dependent Correlation (DDC). Mutual information of each feature and decision is calculated and top 20 important features \{feature no.: 3, 5, 40, 24, 2, 10, 41, 36, 8, 13, 27, 28, 22, 11, 14, 17, 18, 7, 9 and 15\} are selected and evaluated by SVM classifier. The classified result is 93.46\% detection accuracy. \hyperref[b11]{[12]} Applied Information Gain (IG), Correlation-based (CFS), Gain Ratio (GR) feature selection to reduce the dimensionality of NSL-KDD dataset, and built a decision tree classifiers of the three feature selection methods. The three classifier recorded an improved performance than the classifier built with the whole NSL-KDD dataset.\par
[13] Proposed a feature selection method that combined three filter methods; Gain ratio, Chi-squared and Relief F (triple-filter) in a cluster-based heterogeneous Wireless sensor network (WSN) for attacks classification. 14 important features of the NSL-KDD intrusion detection benchmark dataset out of the 41 original features were extracted for intrusion detection classifier. Results obtained show that the proposed method can effectively reduce the number of features with a high classification accuracy and detection rate in comparison with other filter methods. 
\section[{II. Methodology}]{II. Methodology}\par
The proposed architecture of the Comparative Analysis of Selected Filtered Feature Rankers Evaluators for Cyber Attacks Detection is depicted in Figure  {\ref 1}. The discretization of the UNSW-NB15 dataset was first carried out to make it suitable for machine learning. Four Filtered Feature Rankers Evaluators algorithms; (Information Gain, Relief F, Gain Ration, and Correlation) rankers were used to rank and select the optimal relevant features of training and testing UNSW-NB15 intrusion datasets. The training dataset with the all it feature and the reduced features of the training datasets were used to train the K Nearest Neighbors (KNN, and Naive Bayes' algorithms. The testing dataset with the all it features and the reduced features of the testing dataset were used to evaluate the two classifiers. The model's training is depicted in black arrow lines while the model's evaluation is depicted in red arrow lines in the figure. The results of the evaluation for each reduced dataset were analyzed. 
\section[{a) Description of UNSW-NB15 Dataset}]{a) Description of UNSW-NB15 Dataset}\par
The UNSW NB-15 dataset was developed using the IXIA Perfect Storm tool by the cybersecurity research group at the Australian Center for Cyber Security \hyperref[b13]{[14]}. It is a fusion of normal network traffic packets, and synthetic modern-day network traffics attacks. The training and testing contain 82,332 and 174,341 records with 49 features each, respectively \hyperref[b13]{[14]}. The dataset comprises nine attack categories and normal traffic, and it is suitable for the effective detection of existing and new attacks \hyperref[b13]{[14]}. The details of both attack and normal traffic, coupled with the records in the training and testing categories, are presented in Table \hyperref[tab_0]{1}.  
\section[{i. Description of Attributes Selection Evaluators}]{i. Description of Attributes Selection Evaluators}\par
Attributes Selection Evaluator ranks features based on their relevant to the target class, ranking is a way of evaluating relevant features and selecting a minimal set of features based on given criteria in order to build simple models, that take less time to compute and become more understandable Feature ranking evaluation criterion compute the score S(fi) of feature (fi) of the training dataset. By convention a high score implies important (relevant) of the feature to the target class and select the k highest ranked features according to S. This is usually not optimal, but computationally efficient and often preferable to other, more complicated feature selection methods that involve searching through the entire search space. In this study, we use four feature-ranking techniques; Correlation Attribute Evaluator (CAE), Gain Ratio Attribute Evaluator (GAE), Information Gain attribute Evaluator (IGAE) and Relief F Attribute Evaluator (RFAE). 
\section[{a. Correlation Attribute Evaluator (CAE)}]{a. Correlation Attribute Evaluator (CAE)}\par
Correlation Attribute Evaluator (CAE), evaluate Attribute using correlation analysis. The correlation between each attributes x and the target class Y, can be measured by finding correlation coefficient. A good feature is expected to have a higher correlation coefficient between it and target class. In correlation attribute evaluator method the attributes are considered based on their values where each value is treated as an indicator. CAE handles only nominal attributes input for evaluation and it uses Pearson's formula for computing correlation coefficient. for a candidate feature xi ? X and regression target Y the Pearson correlation coefficient is given by \hyperref[b0]{(1)} where cov designates the covariance and var the variance. 
\section[{b. Information Gain attribute Evaluator (IGAE)}]{b. Information Gain attribute Evaluator (IGAE)}\par
Information gain (IG) measures the amount of information in bits about the class prediction, if the only information available is the presence of a feature and the corresponding class distribution. Concretely, it measures the expected reduction in entropy (uncertainty associated with a random feature) \hyperref[b14]{[15]}, it is given by equation 2. 
\section[{Info Gain (Class, feature) = H (target class (Y)) -H (target class(Y) | feature (X))}]{Info Gain (Class, feature) = H (target class (Y)) -H (target class(Y) | feature (X))} 
\section[{???? = ??(??) ? ??(??|??) ? ??(??) ? ??(??|??)}]{???? = ??(??) ? ??(??|??) ? ??(??) ? ??(??|??)}\par
(2) 
\section[{Where H (Y); t he e ntropy of t he t arget c lass H (Y) and ??(?? | ??) is t he e ntropy of t arget class gi ven a c ertain attribute ??.}]{Where H (Y); t he e ntropy of t he t arget c lass H (Y) and ??(?? | ??) is t he e ntropy of t arget class gi ven a c ertain attribute ??.}\par
The entropy of the target class Y is given by equation \hyperref[b2]{(3)}. 
\section[{??(??)}]{??(??)}= ? ? ??(??) log 2 ???(??)? ?????\textbf{(3)}\par
Equation (  {\ref 4}) gives the entropy of target class Y after observing feature X. 
\section[{??(??|??)}]{??(??|??)}= ? ? ??(??) ? ??(??|??) log 2 ???(??|??)? ????? ????? (4) 
\section[{c. Gain Ratio Attribute Evaluator (GRAE)}]{c. Gain Ratio Attribute Evaluator (GRAE)}\par
Gain ratio (GR) is a modification of the information gain that reduces its bias. It considered the number and size of branches in choosing an attribute. It assess the value of an attribute by measuring its gain ratio with respect to the target class \hyperref[b15]{[16]}. the root attribute is the attribute of the UNSW-NB15 with the highest gain ratio, the gain ratio is the ratio of the information gain and the split information for the attribute as presented in equation 5. 
\section[{Gain Ratio = ?????????????????????? ????????(??) ?????????? ??????????????????????(??)}]{Gain Ratio = ?????????????????????? ????????(??) ?????????? ??????????????????????(??)}\par
The information gain of attribute X is given by equation 2.\par
The Split information value of an attribute is chosen by taking the average of all the values in the domain of current attribute. It is given by equation 6. 
\section[{??????????(??)}]{??????????(??)}= ? ? |??| |??| ? log 2 |??| |??| ?????? d. Relief Attribute Evaluator (RFAE)\par
Relief Attribute Evaluator (RFAE) sample an instance recurrently using distance function taking into consideration the value of the given attribute for the nearest instance of the same and different class \hyperref[b12]{[13]}. The original Relief algorithm, proposed by Kira and Rendell \hyperref[b7]{[8]}, is a two-class filtering algorithm for features normalized to [0, 1]. Each feature is initially assigned a zero weight. An A-dimensional training example R is chosen randomly and the Euclidean distance to all other instances calculated. Denote the nearest hit in the same class H, and the nearest miss in a different-class M. Since a good feature R[A] should be able to separate class values, it should have a small distance to H and a large distance to M. Hence W[A] is adjusted to reward good features and penalize poor ones. The final selection of features is made by selecting those large W[A], (that is . those that exceed a given threshold.) 
\section[{ii. Description of Machine learning techniques}]{ii. Description of Machine learning techniques}\par
Two machine learning algorithms, namely; KNN and Naïve Bayes were used in this study to build the intrusion detection system. 
\section[{a. K-Nearest Neighbor}]{a. K-Nearest Neighbor}\par
Let p i and qt represent the instance to be classified and the other instances in the dataset having the same number of features as P respectively, Knearest neighbor Euclidean distance between p i and q t is defined in equation 7.2 1 ( ,q ) ( ) n i t i i i d p p q = = ? ?\textbf{(7)}\par
From equation ( \hyperref[formula_0]{3}), a given instance will be classified as the attack categories having majority attacks among top k closest instance to the given instance. 
\section[{b. Naïve Bayes}]{b. Naïve Bayes}\par
Given the UNSW-NB15 intrusion detection dataset that have X number of attributes called the predictors (X = x 1 , x 2 ,...,x n ) and another attribute y called the class label, with ten members y 1 ,....y 10 , the Naive Bayes probability that a class y j will be assigned to a given unlabelled instance X is given in equation 8. 
\section[{??(??}]{??(??}?? | ?? 1 , ? . , ?? 43 ) = ??(?? ?? )??(?? ?? |?? ?? ) ??(?? ?? ) ( ? ?? = 0,1, ? ? ,9 )\textbf{(8)}\par
Maximum posterior probability for classifying a new instance attack categories is given in Equation \hyperref[formula_5]{9}.?? = arg ?????? ?? ???? ?? ? ?? 9 ?? =0 ??? ?? ??? (?? 1 , ?? 2 , ? ?? 43 | ?? ?? )\textbf{(9)} 
\section[{c) Performance Evaluation Metrics}]{c) Performance Evaluation Metrics}\par
Performance evaluation metrics play significant roles in assessing the predictive performance of the model and determining the model's fitness for the classification purpose. The confusion matrix, also known as the error matrix, is one of the most intuitive and easiest metrics used for finding the correctness and accuracy of the model.  
\section[{i. Accuracy}]{i. Accuracy}\par
Accuracy (ACC) is the ratio of all correctly classified network packets to the total number of instances in the intrusion test dataset, it is given by equation.1. An accuracy of 1 implies error rate of 0 and an accuracy of 0 indicate error rate of 10. 
\section[{TP TN ACC FN FP TN TP}]{TP TN ACC FN FP TN TP}+ = + + +\textbf{(10)}\par
ii. False Positive Rate (FPR) or False Alarm Rate (FAR) False Positive Rate (FPR) or False Alarm Rate (FAR) is the proportion of actual network attacks cases that were predicted as Normal packets by the model. FPR should be as low as possible to avoid unwanted false alarms. it is given by equation 11. 
\section[{FP FPR FAR}]{FP FPR FAR}\par
TN FP = = + \hyperref[b10]{(11)} iii. Precision Precision is the ratio of correctly predicted positive observations to the total predicted positive observations. High precision relates to the low false positive rate. it is given by equation 12. 
\section[{Pr}]{Pr}\par
TP ecision TP FP = + 
\section[{III. Experimental Setup and Results Discussion}]{III. Experimental Setup and Results Discussion}\par
Four feature selection rankers were used to select the relevant features of the UNSW-NB15 intrusion dataset to build Intrusion Detection System. Two classification models (Naïve Bayes and KNN) were used to build the Intrusion detection system for the cyberattacks detection and classification of Network traffic a computer network. The relevant features of the UNSW-NB15 intrusion detection dataset selected by the four (4) filter features rankers are presented in Table \hyperref[tab_1]{2}. Relief F features ranker selected thirteen (13) features, Information Gain features ranker selected fourteen \hyperref[b14]{(15)} features, Gain ration selected fifteen (  {\ref 14}) features, while correlation ranker selected eleven (11) features. It was observed that Proto, Service and Ct\textunderscore dst\textunderscore sport\textunderscore ltm were the only features that were commonly selected by the feature selection algorithms. Thus, they were the features observed to be the most relevant based on the four methods of evaluating the relevance and having the greatest importance in the detection and classification of attack packets in the network traffics.\par
These reduced selected features with the complete features were used to build Intrusion detection systems of Naïve Bayes and KNN. The UNSW-NB15 testing dataset was used to evaluate all the classifiers. The confusion matrix and the performance of the KNN and Naïve Bayes classifiers with each of the selected features of the ranking feature technique is presented in Table  {\ref 3} and 4 respectively. From tables 3 and 4, it shows that KNN and Naive Bayes intrusion detection models of Relief F selected features that identified thirteen (13) features recorded the best performance in terms of detection accuracy, classification precision and false alarm rate. The Intrusion detection models of KNN and Naïve Bayes of the fourteen (14) features identified by the Gain Ratio recorded the second best performance in terms of the selected performance metrics. Correlation and information Gain recorded the third and the fourth performances among the Rankers Features Selection Techniques respectively. Intrusion detection models of the two classifier with all of features of the UNSW-NB15 intrusion detection network dataset recorded the least and poorest performance, this result shows the importance and ability of the Rankers Features Selection Techniques to improve the performance of intrusion detection models.\par
The comparison analysis of the two classifiers shows that, KNN intrusion detection models recorded better detection accuracy, precision and false alarm rate than the Naïve Bayes model in the classification of UNSW-NB15 intrusion detection network dataset, it can be further deduced that the Relief F features selection method with KNN is the best-performing algorithm for the detection of network packets of UNSW-NB15 intrusion detection dataset. The comparison analysis of the selected Rankers Features Selection Techniques with each machine learning algorithms, based on the selected performance metrics is illustrated in Figure  {\ref 2}.\par
( ) E\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}T}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}}\end{figure}
  \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.85\textwidth}}
Models\\
Evaluation\end{longtable} \par
  {\small\itshape [Note: b) Data Munging and AnalyticThis section outlines the Feature Rankers Evaluators and the machine learning techniques used for this study.]} 
\caption{\label{tab_0}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.24640600315955766\textwidth}P{0.009399684044233808\textwidth}P{0.003357030015797788\textwidth}P{0.19067930489731436\textwidth}P{0.004699842022116904\textwidth}P{0.17389415481832543\textwidth}P{0.006714060031595576\textwidth}P{0.09869668246445498\textwidth}P{0.10675355450236966\textwidth}P{0.005371248025276461\textwidth}P{0.004028436018957346\textwidth}}
Year 2022\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{3}{l}{Relief F (13)}\tabcellsep \multicolumn{2}{l}{Gain Ratio (14)}\tabcellsep \multicolumn{3}{l}{Information Gain (15) Correlation Ranker (11)}\\
proto,\tabcellsep \multicolumn{2}{l}{service,}\tabcellsep \multicolumn{2}{l}{Proto, service, smean,}\tabcellsep \multicolumn{3}{l}{proto, service, state,}\tabcellsep proto,\tabcellsep service,\tabcellsep state,\\
state,\tabcellsep \multicolumn{2}{l}{smean,}\tabcellsep \multicolumn{2}{l}{ct\textunderscore state\textunderscore ttl, ct\textunderscore dst\textunderscore sp}\tabcellsep smean,\tabcellsep swin,\tabcellsep sttl,\tabcellsep ct\textunderscore srv\textunderscore src,\\
\multicolumn{3}{l}{ct\textunderscore dst\textunderscore src\textunderscore ltm}\tabcellsep ort\textunderscore ltm,\tabcellsep \tabcellsep \multicolumn{2}{l}{ct\textunderscore state\textunderscore ttl,}\tabcellsep dwin,\tabcellsep ct\textunderscore dst\textunderscore src\textunderscore ltm, swin, sttl,\\
\multicolumn{3}{l}{Sttl, ct\textunderscore state\textunderscore ttl,}\tabcellsep \multicolumn{2}{l}{ct\textunderscore dst\textunderscore dport\textunderscore ltm,}\tabcellsep \multicolumn{2}{l}{ct\textunderscore dst\textunderscore sport\textunderscore ltm,}\tabcellsep Dwin, ct\textunderscore dst\textunderscore sport\textunderscore ltm,\\
\multicolumn{2}{l}{ct\textunderscore srv\textunderscore src,}\tabcellsep \tabcellsep ct\textunderscore srv\textunderscore dst,\tabcellsep Sbytes,\tabcellsep \multicolumn{2}{l}{ct\textunderscore src\textunderscore dport\textunderscore ltm,}\tabcellsep ct\textunderscore src\textunderscore dport\textunderscore ltm,\\
\multicolumn{3}{l}{ct\textunderscore dst\textunderscore sport\textunderscore ltm,}\tabcellsep \multicolumn{2}{l}{dbytes, rate, dmean}\tabcellsep Sbytes,\tabcellsep dttl,\tabcellsep tcprtt,\tabcellsep ct\textunderscore srv\textunderscore dst\\
\multicolumn{2}{l}{ct\textunderscore srv\textunderscore dst,}\tabcellsep dttl,\tabcellsep \multicolumn{2}{l}{,dpkts , dur, sload}\tabcellsep \multicolumn{2}{l}{stcpb, dtcpb}\\
\multicolumn{2}{l}{ct\textunderscore dst\textunderscore ltm,}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
ct\textunderscore src\textunderscore ltm\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_1}Table 2 :}\end{figure}
 		 		\backmatter  			 \par
relevant features to model intrusion detection systems of KNN and Naïve Bayes machine learning algorithms. The Results of the features ranking shows that Relief F features ranker selected thirteen (13) features, Information Gain features ranker selected fourteen \hyperref[b14]{(15)} features, Gain ration selected fifteen (  {\ref 14}) features, while correlation ranker selected eleven (11) features. Features selected by Relief F recorded the best performance, Gain Ratio recorded the second best performance. Correlation and information Gain recorded the third and the fourth performances respectively, while the use of all the features recorded the least and poorest performance, this result shows the importance and ability of the Rankers Features Selection Techniques to improve the performance of intrusion detection models. All the KNN models recorded better performance than all Naïve Bayes models. The models' performance were measured in terms of Classification /detection accuracy, precision and false alarm rate. The results further shows models of KNN with the reduced features of Relief F features selection method recorded the best overall performance for the detection of network packets of UNSW-NB15 intrusion detection dataset. 
\subsection[{a) Ethical Standard Funding}]{a) Ethical Standard Funding}\par
This research work is self-funded research undertaken by the authors at the Department of Computer Science, School of Applied sciences, Federal Polytechnics, Ile-Oluji, Nigeria. 
\subsection[{Conflict of Interest}]{Conflict of Interest}\par
The corresponding author states that there is no conflict of interest.			 			  				\begin{bibitemlist}{1}
\bibitem[Gogoi et al.]{b5}\label{b5} 	 		\textit{},  		 			P Gogoi 		,  		 			M H Bhuyan 		,  		 			D K Bhattacharyya 		.  		 	 
\bibitem[Mitchell ()]{b14}\label{b14} 	 		\textit{},  		 			T Mitchell 		.  	 	 		\textit{Machine Learning. McGraw-Hill}  		1997.  	 
\bibitem[ Int. J. Mach. Learn. & Cyber ()]{b16}\label{b16} 	 		\textit{},  		 \xref{http://dx.doi.org/10.1007/s13042-015-0469-8}{10.1007/s13042-015-0469-8}.  		 \url{https://doi.org/10.1007/s13042-015-0469-8}  	 	 		\textit{Int. J. Mach. Learn. \& Cyber}  		2017. 8 p. .  	 
\bibitem[Qu et al. (2005)]{b10}\label{b10} 	 		‘A new dependency and correlation analysis for features’.  		 			G Qu 		,  		 			S Hariri 		,  		 			M Yousif 		.  		 \xref{http://dx.doi.org/10.1109/TKDE.2005.136}{10.1109/TKDE.2005.136}.  	 	 		\textit{IEEE Transactions on Knowledge and Data Engineering}  		Sept. 2005. 17  (9)  p. .  	 
\bibitem[Chandrashekar and Sahin ()]{b12}\label{b12} 	 		‘A survey on feature selection methods’.  		 			Girish Chandrashekar 		,  		 			Ferat Sahin 		.  	 	 		\textit{Computers and Electrical Engineering}  		 0045-7906.  		2014. 40 p. .  	 
\bibitem[Isabelle ()]{b2}\label{b2} 	 		‘An Introduction to Variable and Feature Selection’.  		 			G Isabelle 		,  		 			AndreE 		.  	 	 		\textit{Journal of Machine Learning Research}  		2003. 3 p. .  	 
\bibitem[Tariq et al. ()]{b4}\label{b4} 	 		\textit{Analysis of Security Techniques for Detecting Suspicious Activities and Intrusion Detection in Network Traffic. Semantic Scholar. 2012https:// www.semanticscholar.org/paper/Analysis-of-Securit y-Techniques-for-Detecting-and-Tariq-Arshad},  		 			W Tariq 		,  		 			M Arshad 		,  		 			M Saqib 		,  		 			N Gul 		.  		2012.  	 	 (a993 dab8bcd79ec8468c36489e2acabf957b71d0\#citing -papers) 
\bibitem[Aldehim ()]{b17}\label{b17} 	 		\textit{Determining appropriate approaches for using data in feature},  		 			G Aldehim 		,  		 			WangW 		.  		2017.  	 
\bibitem[Wang ()]{b8}\label{b8} 	 		‘Efficient detection of DDoS attacks with important attributes’.  		 			W Wang 		,  		 			GombaultS 		.  	 	 		\textit{the 3rd IEEE International conference on Risks and Security of Internet and Systems (CRiSIS'08)},  				 (Tozeur, Tunisia)  		2008. p. .  	 
\bibitem[Opeyemi et al. ()]{b9}\label{b9} 	 		\textit{Ensemble-based Multi-Filter Feature Selection Method for DDoS Detection in Cloud Computing, journal of wireless communication and networking},  		 			O Opeyemi 		,  		 			R C Kim-Kwang 		,  		 			D Ali 		,  		 			X Zheng 		,  		 			Mqhele 		.  		 \xref{http://dx.doi.org/10.1186/s13638-016-0623-3}{10.1186/s13638-016-0623-3}.  		2016. 2016.  	 
\bibitem[Duch et al. ()]{b7}\label{b7} 	 		‘Feature Ranking, Selection and Discretization’.  		 			W Duch 		,  		 			T Winiarski 		,  		 			J Biesiada 		.  	 	 		\textit{Int. Conf. on Artificial Neural Networks (ICANN) and Int. Conf. on Neural Information Processing (ICONIP)},  				2003. 2003. p. .  	 
\bibitem[Sang-Hyun and Hee-Su (2014)]{b15}\label{b15} 	 		‘Feature Selection using Attribute Ratio in NSL-KDD data’.  		 			C Sang-Hyun 		,  		 			C Hee-Su 		.  	 	 		\textit{International Conference Data Mining, Civil and Mechanical Engineering (ICDMCME'2014)},  				 (Bali (Indonesia)  		2014. Feb 4-5, 2014.  	 
\bibitem[Schreier (2015)]{b0}\label{b0} 	 		\textit{On Cyberwarfare, DCAF Horizon},  		 			F Schreier 		.  		 \url{https://www.dcaf.ch/sites/default/files/publications/documents/OnCyberwarfare-Schreier.pdf}  		2015. 2015. Accessed 2 nd April, 2021.  	 
\bibitem[Kalita ()]{b6}\label{b6} 	 		‘Packet and Flow Based Network Intrusion Dataset’.  		 			J K Kalita 		.  		 \xref{http://dx.doi.org/10.1007/978-3-642-32129-0_34}{10.1007/978-3-642-32129-0\textunderscore 34}.  		 \url{https://doi.org/10.1007/978-3-642-32129-0\textunderscore 34}  	 	 		\textit{Communications in Computer and Information Science}  		2012. 2012. p. .  	 
\bibitem[Olasehinde et al. ()]{b3}\label{b3} 	 		‘Reduced Features Intrusion Detection Systems Classification Accuracy Improvement’.  		 			O O Olasehinde 		,  		 			K Williams 		,  		 			B O Adegoke 		.  		 \xref{http://dx.doi.org/10.1023/A:1006624031083}{10.1023/A:1006624031083}.  		 \url{http://dx.doi.org/10.1023/A:1006624031083}  	 	 		\textit{International Journal of Scientific \& Engineering Research}  		2019. 2019. 10  (12)  p. .  	 
\bibitem[Kavita and Pranjali (2014)]{b1}\label{b1} 	 		‘Survey on Data Mining Techniques for Intrusion Detection System’.  		 			P Kavita 		,  		 			D Pranjali 		.  	 	 		\textit{International Journal of Research Studies in Science, Engineering and Technology}  		April 2014. 1  (1)  p. .  	 
\bibitem[Munson and Khoshgoftaar ()]{b11}\label{b11} 	 		‘The dimensionality of program complexity’.  		 			J C Munson 		,  		 			T M Khoshgoftaar 		.  	 	 		\textit{Proceedings of the 11th international conference on Software engineering, ICSE '89},  				 (the 11th international conference on Software engineering, ICSE '89)  		1989. ACM. p. .  	 
\bibitem[Moustafa and Slay J ()]{b13}\label{b13} 	 		\textit{UNSW-NB15: A Comprehensive DataSet for Network Intrusion Detection Systems Military Communications and Information Systems Conference},  		 			N Moustafa 		,  		 			Slay J 		.  		2015. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
