Towards Supercomputing Categorizing the Maliciousness upon Cybersecurity Blacklists with Concept Drift

[EN] 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, an...

Descripción completa

Detalles Bibliográficos
Autores: Carriegos Vieira, Miguel, Castro García, Noemí de, Escudero García, David
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2023
País:España
Institución:Universidad Rey Juan Carlos
Repositorio:BULERIA. Repositorio Institucional de la Universidad de León
OAI Identifier:oai:buleria.unileon.es:10612/19285
Acceso en línea:https://www.hindawi.com/journals/cmm/2023/5780357/
https://hdl.handle.net/10612/19285
Access Level:acceso abierto
Palabra clave:Informática
Cybersecurity
Machine learning
IP address
Maliciousness
1203.04 Inteligencia Artificial
1203.17 Informática
Descripción
Sumario:[EN] 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.