IDEAS home Printed from https://ideas.repec.org/a/prg/jnlaip/v2022y2022i3id199p348-360.html
   My bibliography  Save this article

Efficient Machine Learning Model for DDoS Detection System Based on Dimensionality Reduction

Author

Listed:
  • Saad Ahmed Dheyab
  • Shaymaa Mohammed Abdulameer
  • Salama Mostafa

Abstract

Distributed denial of service (DDoS) attacks are one of the most common global challenges faced by service providers on the web. It leads to network disturbances, interruption of communication and significant damage to services. Researchers seek to develop intelligent algorithms to detect and prevent DDoS attacks. The present study proposes an efficient DDoS attack detection model. This model relies mainly on dimensionality reduction and machine learning algorithms. The principal component analysis (PCA) and the linear discriminant analysis (LDA) techniques perform the dimensionality reduction in individual and hybrid modes to process and improve the data. Subsequently, DDoS attack detection is performed based on random forest (RF) and decision tree (DT) algorithms. The model is implemented and tested on the CICDDoS2019 dataset using different data dimensionality reduction test scenarios. The results show that using dimensionality reduction techniques along with the ML algorithms with a dataset containing high-dimensional data significantly improves the classification results. The best accuracy result of 99.97% is obtained when the model operates in a hybrid mode based on a combination of PCA, LDA and RF algorithms, and the data reduction parameter equals 40.

Suggested Citation

  • Saad Ahmed Dheyab & Shaymaa Mohammed Abdulameer & Salama Mostafa, 2022. "Efficient Machine Learning Model for DDoS Detection System Based on Dimensionality Reduction," Acta Informatica Pragensia, Prague University of Economics and Business, vol. 2022(3), pages 348-360.
  • Handle: RePEc:prg:jnlaip:v:2022:y:2022:i:3:id:199:p:348-360
    DOI: 10.18267/j.aip.199
    as

    Download full text from publisher

    File URL: http://aip.vse.cz/doi/10.18267/j.aip.199.html
    Download Restriction: free of charge

    File URL: http://aip.vse.cz/doi/10.18267/j.aip.199.pdf
    Download Restriction: free of charge

    File URL: https://libkey.io/10.18267/j.aip.199?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:prg:jnlaip:v:2022:y:2022:i:3:id:199:p:348-360. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Stanislav Vojir (email available below). General contact details of provider: https://edirc.repec.org/data/uevsecz.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.