基于概念漂移的网络安全黑名单恶意分类研究

IF 0.9 Q3 MATHEMATICS, APPLIED Computational and Mathematical Methods Pub Date : 2023-05-20 DOI:10.1155/2023/5780357
M. V. Carriegos, N. DeCastro-García, D. Escudero
{"title":"基于概念漂移的网络安全黑名单恶意分类研究","authors":"M. V. Carriegos,&nbsp;N. DeCastro-García,&nbsp;D. Escudero","doi":"10.1155/2023/5780357","DOIUrl":null,"url":null,"abstract":"<div>\n <p>In this article, we have carried out a case study to optimize the classification of the maliciousness of cybersecurity events by IP addresses using machine learning techniques. The optimization is studied focusing on time complexity. Firstly, we have used the extreme gradient boosting model, and secondly, we have parallelized the machine learning algorithm to study the effect of using a different number of cores for the problem. We have classified the cybersecurity events’ maliciousness in a biclass and a multiclass scenario. All the experiments have been carried out with a well-known optimal set of features: the geolocation information of the IP address. However, the geolocation features of an IP address can change over time. Also, the relation between the IP address and its label of maliciousness can be modified if we test the address several times. Then, the models’ performance could degrade because the information acquired from training on past samples may not generalize well to new samples. This situation is known as concept drift. For this reason, it is necessary to study if the optimization proposed works in a concept drift scenario. The results show that the concept drift does not degrade the models. Also, boosting algorithms achieving competitive or better performance compared to similar research works for the biclass scenario and an effective categorization for the multiclass case. The best efficient setting is reached using five nodes regarding high-performance computation resources.</p>\n </div>","PeriodicalId":100308,"journal":{"name":"Computational and Mathematical Methods","volume":"2023 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2023/5780357","citationCount":"0","resultStr":"{\"title\":\"Towards Supercomputing Categorizing the Maliciousness upon Cybersecurity Blacklists with Concept Drift\",\"authors\":\"M. V. Carriegos,&nbsp;N. DeCastro-García,&nbsp;D. Escudero\",\"doi\":\"10.1155/2023/5780357\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n <p>In this article, we have carried out a case study to optimize the classification of the maliciousness of cybersecurity events by IP addresses using machine learning techniques. The optimization is studied focusing on time complexity. Firstly, we have used the extreme gradient boosting model, and secondly, we have parallelized the machine learning algorithm to study the effect of using a different number of cores for the problem. We have classified the cybersecurity events’ maliciousness in a biclass and a multiclass scenario. All the experiments have been carried out with a well-known optimal set of features: the geolocation information of the IP address. However, the geolocation features of an IP address can change over time. Also, the relation between the IP address and its label of maliciousness can be modified if we test the address several times. Then, the models’ performance could degrade because the information acquired from training on past samples may not generalize well to new samples. This situation is known as concept drift. For this reason, it is necessary to study if the optimization proposed works in a concept drift scenario. The results show that the concept drift does not degrade the models. Also, boosting algorithms achieving competitive or better performance compared to similar research works for the biclass scenario and an effective categorization for the multiclass case. The best efficient setting is reached using five nodes regarding high-performance computation resources.</p>\\n </div>\",\"PeriodicalId\":100308,\"journal\":{\"name\":\"Computational and Mathematical Methods\",\"volume\":\"2023 1\",\"pages\":\"\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2023/5780357\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational and Mathematical Methods\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1155/2023/5780357\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational and Mathematical Methods","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1155/2023/5780357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们进行了一个案例研究,利用机器学习技术优化IP地址对网络安全事件的恶意分类。重点研究了时间复杂度的优化问题。首先,我们使用了极端梯度增强模型,其次,我们将机器学习算法并行化,研究使用不同核数对问题的影响。我们将网络安全事件的恶意分类为一类和多类场景。所有的实验都是用一组众所周知的最优特征进行的:IP地址的地理位置信息。然而,IP地址的地理位置特征会随着时间的推移而改变。另外,通过对IP地址进行多次测试,可以修改IP地址与其恶意标签之间的关系。然后,模型的性能可能会下降,因为从过去样本的训练中获得的信息可能不能很好地推广到新的样本。这种情况被称为概念漂移。因此,有必要研究所提出的优化是否在概念漂移情况下有效。结果表明,概念漂移不会降低模型的质量。此外,与类似的双类场景研究工作相比,增强算法实现了具有竞争力或更好的性能,并对多类情况进行了有效的分类。在高性能计算资源方面,使用5个节点可以达到最佳效率设置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Towards Supercomputing Categorizing the Maliciousness upon Cybersecurity Blacklists with Concept Drift

In this article, we have carried out a case study to optimize the classification of the maliciousness of cybersecurity events by IP addresses using machine learning techniques. The optimization is studied focusing on time complexity. Firstly, we have used the extreme gradient boosting model, and secondly, we have parallelized the machine learning algorithm to study the effect of using a different number of cores for the problem. We have classified the cybersecurity events’ maliciousness in a biclass and a multiclass scenario. All the experiments have been carried out with a well-known optimal set of features: the geolocation information of the IP address. However, the geolocation features of an IP address can change over time. Also, the relation between the IP address and its label of maliciousness can be modified if we test the address several times. Then, the models’ performance could degrade because the information acquired from training on past samples may not generalize well to new samples. This situation is known as concept drift. For this reason, it is necessary to study if the optimization proposed works in a concept drift scenario. The results show that the concept drift does not degrade the models. Also, boosting algorithms achieving competitive or better performance compared to similar research works for the biclass scenario and an effective categorization for the multiclass case. The best efficient setting is reached using five nodes regarding high-performance computation resources.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
0
期刊最新文献
On the Efficiency of the Newly Developed Composite Randomized Response Technique Approximate Solution of an Integrodifferential Equation Generalized by Harry Dym Equation Using the Picard Successive Method A Mathematical Analysis of the Impact of Immature Mosquitoes on the Transmission Dynamics of Malaria Parameter-Uniform Convergent Numerical Approach for Time-Fractional Singularly Perturbed Partial Differential Equations With Large Time Delay Mortality Prediction in COVID-19 Using Time Series and Machine Learning Techniques
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1