A Novel Sequence Tensor Recovery Algorithm for Quick and Accurate Anomaly Detection
Wenbin Huang, Kun Xie, Jie Li
Abstract
Anomalous traffic detection is a vital task in advanced Internet supervision and maintenance. To detect anomalies accurately, various data representations, such as vectors, matrices, and tensors, have been adopted to model traffic data. Among them, tensor-based methods outperform others due to their capability of capturing comprehensive correlations between complex network traffic. However, existing tensor-based algorithms remain certain shortcomings, such as working offline, cannot timely detect traffic anomalies, and high computation costs. To conquer the aforementioned deficiencies, we propose a novel <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">sequence tensor recovery</i> (STR) algorithm in this paper, which utilizes the results of historical tensor decomposition to achieve quick and accurate anomaly detection with low consumption when traffic data series arrive. Furthermore, we propose a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">dynamic sequence tensor recovery</i> (DSTR) algorithm to improve anomaly detection accuracy by better capturing the variation over time of the comprehensive correlation of traffic data hidden in the tensor structure. The experimental results on two real traffic traces, Abilene and G <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\grave{E}$</tex-math></inline-formula> ANT, indicate the proposed STR and DSTR algorithms are superior to the state-of-the-art algorithms in terms of accuracy and computation cost.