Anomaly Detection: Review and preliminary Entropy method tests
Pelumi Oluwasanya

TL;DR
This paper reviews anomaly detection in wireless sensor networks, focusing on entropy-based methods, and presents preliminary tests comparing probability density function estimation techniques for entropy calculation.
Contribution
It introduces a non-parametric entropy estimation approach using data splitting and compares it with k-nearest neighbor methods for anomaly detection.
Findings
Data-split method provides better PDF approximation than k-NN
Entropy increases with anomalous data points in the dataset
Preliminary results support entropy-based anomaly detection effectiveness
Abstract
Anomalies are strange data points; they usually represent an unusual occurrence. Anomaly detection is presented from the perspective of Wireless sensor networks. Different approaches have been taken in the past, as we will see, not only to identify outliers, but also to establish the statistical properties of the different methods. The usual goal is to show that the approach is asymptotically efficient and that the metric used is unbiased or maybe biased. This project is based on a work done by [1]. The approach is based on the principle that the entropy of the data is increased when an anomalous data point is measured. The entropy of the data set is thus to be estimated. In this report however, preliminary efforts at confirming the results of [1] is presented. To estimate the entropy of the dataset, since no parametric form is assumed, the probability density function of the data set…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications · Network Security and Intrusion Detection · Advanced Malware Detection Techniques
