Nadege: When Graph Kernels meet Network Anomaly Detection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Nadege: When Graph Kernels meet Network Anomaly Detection


With the continuous growing level of dynamicity, heterogeneity, and complexity of traffic data, anomaly detection remains one of the most critical tasks to ensure an efficient and flexible management of a network. Recently, driven by their empirical success in many domains, especially bioinformatics and computer vision, graph kernels have attracted increasing attention. Our work aims at investigating their discrimination power for detecting vulnerabilities and distilling traffic in the field of networking. In this paper, we propose Nadege, a new graph-based learning framework which aims at preventing anomalies from disrupting the network while providing assistance for traffic monitoring. Specifically, we design a graph kernel tailored for network profiling by leveraging propagation schemes which regularly adapt to contextual patterns. Moreover, we provide provably efficient algorithms and consider both offline and online detection policies. Finally, we demonstrate the potential of kernel-based models by conducting extensive experiments on a wide variety of network environments. Under different usage scenarios, Nadege significantly outperforms all baseline approaches.
Fichier principal
Vignette du fichier
2022-INFOCOM-nadege-graph-kernel-anomaly-detection.pdf (451 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03655867 , version 1 (30-04-2022)


  • HAL Id : hal-03655867 , version 1


Hicham Lesfari, Frédéric Giroire. Nadege: When Graph Kernels meet Network Anomaly Detection. IEEE International Conference on Computer Communications (INFOCOM), May 2022, London, United Kingdom. ⟨hal-03655867⟩
108 View
162 Download


Gmail Facebook X LinkedIn More