Abstract

A massive amount of real-time and evolving streaming data are produced from various devices and applications. Anomaly detection is one of the main tasks of streaming data mining with many practical applications. However, without prior knowledge, it is difficult to detect the anomaly accurately and quickly. In this paper, we propose an unsupervised anomaly detection algorithm (GC-ADS), which is based on the idea of grid clustering and Gaussian distribution. Specifically, the data space is first segmented using the grid structure, then the data points are mapped to grids and finally grids are clustered. The anomaly can be preliminarily judged according to the cluster density. To solve the problem that clustering cannot distinguish between noise and anomaly, based on the idea of data similarity and Gaussian distribution, a noise recognition model is designed. In addition, a data filtering model based on grid and sliding window is designed to save memory and retain valid information. The proposed method is compared with the state-of-the-art methods on the Numenta anomaly benchmark. Experimental results indicate that GC-ADS detects anomalies more accurately than other methods with less time cost.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.