k近邻与决策树检测分布式拒绝服务的比较分析

Ilham Ramadhan, Parman Sukarno, M. A. Nugroho
{"title":"k近邻与决策树检测分布式拒绝服务的比较分析","authors":"Ilham Ramadhan, Parman Sukarno, M. A. Nugroho","doi":"10.1109/ICoICT49345.2020.9166380","DOIUrl":null,"url":null,"abstract":"Distributed Denial of Service (DDoS) attacks are attacks made by several attackers by flooding the victim’s device with a packet. The ease of making DDoS attacks has led to an increase of these attacks in network traffic. In contrast, the method of non-machine learning Intrusion Detection System (IDS) is now seen very inaccurate. There is a need then for an IDS method with machine learning (ML) that is more accurate in detecting attacks. Several previous studies have known that the K-Nearest Neighbor (KNN) and Decision Tree (DT) algorithms are two algorithms with high accuracy in detecting DDoS attacks. However, research comparing the two algorithms is not found so far. In this study, a comparative analysis was carried out between the two algorithms. The result of this study showed that DT had a higher accuracy with an accuracy value of 99.91% than KNN which only had an accuracy value of 98.94% in detecting DDoS attacks.","PeriodicalId":113108,"journal":{"name":"2020 8th International Conference on Information and Communication Technology (ICoICT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Comparative Analysis of K-Nearest Neighbor and Decision Tree in Detecting Distributed Denial of Service\",\"authors\":\"Ilham Ramadhan, Parman Sukarno, M. A. Nugroho\",\"doi\":\"10.1109/ICoICT49345.2020.9166380\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed Denial of Service (DDoS) attacks are attacks made by several attackers by flooding the victim’s device with a packet. The ease of making DDoS attacks has led to an increase of these attacks in network traffic. In contrast, the method of non-machine learning Intrusion Detection System (IDS) is now seen very inaccurate. There is a need then for an IDS method with machine learning (ML) that is more accurate in detecting attacks. Several previous studies have known that the K-Nearest Neighbor (KNN) and Decision Tree (DT) algorithms are two algorithms with high accuracy in detecting DDoS attacks. However, research comparing the two algorithms is not found so far. In this study, a comparative analysis was carried out between the two algorithms. The result of this study showed that DT had a higher accuracy with an accuracy value of 99.91% than KNN which only had an accuracy value of 98.94% in detecting DDoS attacks.\",\"PeriodicalId\":113108,\"journal\":{\"name\":\"2020 8th International Conference on Information and Communication Technology (ICoICT)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 8th International Conference on Information and Communication Technology (ICoICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICoICT49345.2020.9166380\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 8th International Conference on Information and Communication Technology (ICoICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICoICT49345.2020.9166380","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

分布式拒绝服务攻击(DDoS)是由多个攻击者通过向受害者设备发送大量数据包的方式进行的攻击。DDoS攻击的易发性导致了网络流量中此类攻击的增加。相比之下,非机器学习入侵检测系统(IDS)的方法现在被认为是非常不准确的。因此,需要一种具有机器学习(ML)的IDS方法,以更准确地检测攻击。已有研究表明,k -最近邻(KNN)算法和决策树(DT)算法是检测DDoS攻击准确率较高的两种算法。但是,目前还没有比较这两种算法的研究。在本研究中,对两种算法进行了对比分析。本研究结果表明,DT检测DDoS攻击的准确率为99.91%,而KNN检测DDoS攻击的准确率只有98.94%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparative Analysis of K-Nearest Neighbor and Decision Tree in Detecting Distributed Denial of Service
Distributed Denial of Service (DDoS) attacks are attacks made by several attackers by flooding the victim’s device with a packet. The ease of making DDoS attacks has led to an increase of these attacks in network traffic. In contrast, the method of non-machine learning Intrusion Detection System (IDS) is now seen very inaccurate. There is a need then for an IDS method with machine learning (ML) that is more accurate in detecting attacks. Several previous studies have known that the K-Nearest Neighbor (KNN) and Decision Tree (DT) algorithms are two algorithms with high accuracy in detecting DDoS attacks. However, research comparing the two algorithms is not found so far. In this study, a comparative analysis was carried out between the two algorithms. The result of this study showed that DT had a higher accuracy with an accuracy value of 99.91% than KNN which only had an accuracy value of 98.94% in detecting DDoS attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信