Abstract
Robust and efficient approaches are needed in real-time monitoring of data streams. In this paper, we focus on anomaly detection on data streams. Existing methods on anomaly detection suffer three problems. 1) A large volume of false positive results are generated. 2) The training data are needed, and the time window of appropriate size along with corresponding threshold has to be determined empirically. 3) Both time and space overhead is usually very high. We propose a novel self-similarity-based anomaly detection algorithm based on piecewise fractal model. This algorithm consumes only limited amount of memory and does not require training process. Theoretical analysis of the algorithm are presented. The experimental results on the real data sets indicate that, compared with existing anomaly detection methods, our algorithm can achieve higher precision with reduced space and time complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.