Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2020
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2020
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2020
License: CC BY
Data sources: ZENODO
versions View all 2 versions
addClaim

A Machine Learning Model for Network Intrusion Detection System Using Hidden Markov Model

Authors: Pamela Ama Nyan; Joseph Kobina Panford; Francis Ato Nyan; James Ben Hayfron-Acquah;

A Machine Learning Model for Network Intrusion Detection System Using Hidden Markov Model

Abstract

Cyberattacks are becoming more sophisticated as attackers continuously use diverse strategies and tactics to attack target systems. To avert this impending threat, various possible solutions have been implemented and a variety of security systems keeps emerging. One of these solutions is intrusion detection systems (IDS). The challenge in developing a model that is efficient to detect intrusion is directly dependent on the features selected during the training process and also to detect known and unknown attacks. In this thesis a machine learning model is proposed based on a Hidden Markov Model. The model was trained and tested with data from the NSL KDD dataset, which was selected based on four categories of attacks. The relevant features for training were selected from the dataset based on the scores evaluated from a Laplacian model. New features were extracted from the selected features based on variance from a Principal Component Analysis to decrease the dimensionality of the dataset. K-Means Algorithm was utilized in mapping the extracted data into a new feature space for training. The proposed model produced an accuracy of 83.85% which outperformed the accuracies of the existing models built with the Support Vector Machine (SVM), Random Forest (RF), Deep Belief Network (DBN), and the Convolutional Neural Networks (CNN) which had 71.30%, 74.18%, 71.91% and 80.13% respectively. Keywords: Cyberattacks, intrusion, security, detection, Hidden Markov Model

Keywords

Information Security, Computer Science, Cyber security, IJCSIS

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 8
    download downloads 15
  • 8
    views
    15
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
8
15
Green