%0 Journal Article
%A HE Liang1
%A WANG Yongcheng1
%A LI Yun1
%A CHU Yanjie1
%A SHEN Chao2
%T Network Anomaly Detection Algorithm Based on Lindeberg-Feller Central Limit Theorem
%D 2019
%R 10.3778/j.issn.1002-8331.1811-0026
%J Computer Engineering and Applications
%P 41-47
%V 55
%N 4
%X In the fields of network maintenance and operation, it attracts much attention how to detect and prompt the network anomalies in time. Anomalous events are less in dataset than the normal ones, leading to the fact that it is difficult to use the two-class classifications for anomaly detection because of the imbalance of data labeled as normal or anomalous. Meanwhile, anomalous events are in various patterns and there is little prior information about the anomaly that the users are concerned with, therefore, it is necessary to model the normal data and use them for anomaly detection by comparing the received data with the normal model. Based on Lindeberg-Feller central limit theorem, a hypothesis test is designed to detect whether the data to be tested is anomalous or not, according to the refusing area calculated by the confidential parameter. Finally, the theorem of this algorithm is simulated and the performance is also tested both on the common and the actual datasets. When the users take the correlation features of the anomalous events as the algorithm input, the recall ratio reaches 90%.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1811-0026