GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference 2009
DOI: 10.1109/glocom.2009.5425504
|View full text |Cite
|
Sign up to set email alerts
|

Online Anomaly Detection Using KDE

Abstract: Large backbone networks are regularly affected by a range of anomalies. This paper presents an online anomaly detection algorithm based on Kernel Density Estimates. The proposed algorithm sequentially and adaptively learns the definition of normality in the given application, assumes no prior knowledge regarding the underlying distributions, and then detects anomalies subject to a user-set tolerance level for false alarms. Comparison with the existing methods of Geometric Entropy Minimization, Principal Compon… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0
1

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
3
1

Relationship

3
5

Authors

Journals

citations
Cited by 39 publications
(36 citation statements)
references
References 18 publications
0
35
0
1
Order By: Relevance
“…Next come KOAD and KEAD, the performances of both of which are observed to be comparable, with KOAD faring marginally better. It must be remembered here that the thresholds ν 1 and ν 2 must be manually set in KOAD, while KEAD incorporates autonomous setting for all important algorithm parameters [5]. The strikingly low performance of the benchmark NCD-based algorithm may be attributed to the fact that this algorithm requires a significantly longer training period, and needs to maintain a significantly larger database of images to compare new arrivals against [12].…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Next come KOAD and KEAD, the performances of both of which are observed to be comparable, with KOAD faring marginally better. It must be remembered here that the thresholds ν 1 and ν 2 must be manually set in KOAD, while KEAD incorporates autonomous setting for all important algorithm parameters [5]. The strikingly low performance of the benchmark NCD-based algorithm may be attributed to the fact that this algorithm requires a significantly longer training period, and needs to maintain a significantly larger database of images to compare new arrivals against [12].…”
Section: Resultsmentioning
confidence: 99%
“…The Kernel Estimation-based Anomaly Detection (KEAD) algorithm formally states the problem as follows [5]. Given a sequence of multidimensional data points {x i } t+L i=t−L ∈ R D , the objective is to determine if x t is a realisation of probability distribution P n,t or of probability distribution P a .…”
Section: Kernel Estimation-based Anomaly Detectionmentioning
confidence: 99%
See 1 more Smart Citation
“…al [11] brings out the taxonomy of data exfiltration and presents all possible exfiltration methods specifically the information communication based exfiltration using well know protocols. Tarem Ahmed [12] present on-line anomaly detection using Kernel Density Estimation technique.…”
Section: Related Workmentioning
confidence: 99%
“…The algorithm then signals an anomaly upon encountering a deviation from the norm. KOAD was first presented in [3] where it was applied to anomaly detection in IP networks, and extended in [4]. Using KOAD to detect road traffic incidents was suggested in [5].…”
Section: Introductionmentioning
confidence: 99%