Ahmed, Tarem2026-08-232026-08-232009-12-01T. Ahmed, "Online Anomaly Detection Using KDE," GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference, Honolulu, HI, USA, 2009, pp. 1-8, doi: 10.1109/GLOCOM.2009.5425504.97814244414882-s2.0-77951570750https://hdl.handle.net/10361/29457Large 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 Component Analysis and One-Class Neighbor Machine demonstrates that the proposed method achieves superior performance with lower complexity.en-USMachine learning algorithmsEntropyMinimization methodsSpineDetection algorithmsApplication softwarePrincipal component analysisHigh-speed networksAnomaly detection (Computer security).Computer networks--Monitoring.Conference Proceeding10.1109/GLOCOM.2009.5425504