论有效检测僵尸网络的特征选择算法

IF 4.1 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Meher Afroz, Muntaka Ibnath, Ashikur Rahman, Jakia Sultana, Raqeebir Rab
{"title":"论有效检测僵尸网络的特征选择算法","authors":"Meher Afroz, Muntaka Ibnath, Ashikur Rahman, Jakia Sultana, Raqeebir Rab","doi":"10.1007/s10922-024-09817-9","DOIUrl":null,"url":null,"abstract":"<p>The threats of botnets are becoming a growing concern infecting more and more computers every day. Although botnets can be detected from their behavioral patterns, it is becoming more challenging to differentiate the behavior between the malicious traffic and the legitimate traffic as with the advancement of the technologies the malicious traffics are following the similar behavioral patterns of benign traffics. The detection of malicious traffic largely depends on the traffic features that are being used to feed in the detection process. Selecting the best features for effective botnet detection is the main contribution of this paper. At the very beginning, we show the impact of different features on botnet detection process. Then we propose several heuristics to select the best features from a handful of possible features. Some proposed heuristics are truly feature-based and some are group-based, thus generating different accuracy levels. We also analyze time complexity of each heuristic and provide a detailed performance analysis. As working with all combinations of a large number of features is not feasible, some heuristics work by grouping the features based on their similarity in patterns and checking all combinations within the groups of small number of features which improves the time complexity by a large margin. Through experiments we show the efficacy of the proposed feature selection heuristics. The result shows that some heuristics outperform state-of-the-art feature selection algorithms.</p>","PeriodicalId":50119,"journal":{"name":"Journal of Network and Systems Management","volume":"25 1","pages":""},"PeriodicalIF":4.1000,"publicationDate":"2024-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Feature Selection Algorithms for Effective Botnet Detection\",\"authors\":\"Meher Afroz, Muntaka Ibnath, Ashikur Rahman, Jakia Sultana, Raqeebir Rab\",\"doi\":\"10.1007/s10922-024-09817-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The threats of botnets are becoming a growing concern infecting more and more computers every day. Although botnets can be detected from their behavioral patterns, it is becoming more challenging to differentiate the behavior between the malicious traffic and the legitimate traffic as with the advancement of the technologies the malicious traffics are following the similar behavioral patterns of benign traffics. The detection of malicious traffic largely depends on the traffic features that are being used to feed in the detection process. Selecting the best features for effective botnet detection is the main contribution of this paper. At the very beginning, we show the impact of different features on botnet detection process. Then we propose several heuristics to select the best features from a handful of possible features. Some proposed heuristics are truly feature-based and some are group-based, thus generating different accuracy levels. We also analyze time complexity of each heuristic and provide a detailed performance analysis. As working with all combinations of a large number of features is not feasible, some heuristics work by grouping the features based on their similarity in patterns and checking all combinations within the groups of small number of features which improves the time complexity by a large margin. Through experiments we show the efficacy of the proposed feature selection heuristics. The result shows that some heuristics outperform state-of-the-art feature selection algorithms.</p>\",\"PeriodicalId\":50119,\"journal\":{\"name\":\"Journal of Network and Systems Management\",\"volume\":\"25 1\",\"pages\":\"\"},\"PeriodicalIF\":4.1000,\"publicationDate\":\"2024-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Network and Systems Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s10922-024-09817-9\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Systems Management","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10922-024-09817-9","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

僵尸网络的威胁日益令人担忧,每天都有越来越多的计算机受到僵尸网络的感染。虽然可以从僵尸网络的行为模式中检测出僵尸网络,但要区分恶意流量和合法流量的行为变得越来越具有挑战性,因为随着技术的进步,恶意流量的行为模式与良性流量的行为模式相似。恶意流量的检测在很大程度上取决于检测过程中使用的流量特征。本文的主要贡献在于为有效的僵尸网络检测选择最佳特征。首先,我们展示了不同特征对僵尸网络检测过程的影响。然后,我们提出了几种启发式方法,以便从大量可能的特征中选择最佳特征。有些启发式方法是真正基于特征的,有些是基于组的,因此会产生不同的准确度。我们还分析了每种启发式方法的时间复杂性,并提供了详细的性能分析。由于处理大量特征的所有组合并不可行,一些启发式方法根据特征在模式上的相似性对特征进行分组,并检查少量特征组内的所有组合,从而大大提高了时间复杂度。通过实验,我们证明了所提出的特征选择启发式方法的有效性。结果表明,一些启发式方法优于最先进的特征选择算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

On Feature Selection Algorithms for Effective Botnet Detection

On Feature Selection Algorithms for Effective Botnet Detection

The threats of botnets are becoming a growing concern infecting more and more computers every day. Although botnets can be detected from their behavioral patterns, it is becoming more challenging to differentiate the behavior between the malicious traffic and the legitimate traffic as with the advancement of the technologies the malicious traffics are following the similar behavioral patterns of benign traffics. The detection of malicious traffic largely depends on the traffic features that are being used to feed in the detection process. Selecting the best features for effective botnet detection is the main contribution of this paper. At the very beginning, we show the impact of different features on botnet detection process. Then we propose several heuristics to select the best features from a handful of possible features. Some proposed heuristics are truly feature-based and some are group-based, thus generating different accuracy levels. We also analyze time complexity of each heuristic and provide a detailed performance analysis. As working with all combinations of a large number of features is not feasible, some heuristics work by grouping the features based on their similarity in patterns and checking all combinations within the groups of small number of features which improves the time complexity by a large margin. Through experiments we show the efficacy of the proposed feature selection heuristics. The result shows that some heuristics outperform state-of-the-art feature selection algorithms.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.60
自引率
16.70%
发文量
65
审稿时长
>12 weeks
期刊介绍: Journal of Network and Systems Management, features peer-reviewed original research, as well as case studies in the fields of network and system management. The journal regularly disseminates significant new information on both the telecommunications and computing aspects of these fields, as well as their evolution and emerging integration. This outstanding quarterly covers architecture, analysis, design, software, standards, and migration issues related to the operation, management, and control of distributed systems and communication networks for voice, data, video, and networked computing.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信