Exemplar learning for extremely efficient anomaly detection in real-valued time series

• Autores: Michael Jones, Daniel Nikovski, Makoto Imamura, Takahisa Hirata
• Localización: Data mining and knowledge discovery, ISSN 1384-5810, Vol. 30, Nº 6, 2016, págs. 1427-1454
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We investigate algorithms for efficiently detecting anomalies in real-valued one-dimensional time series. Past work has shown that a simple brute force algorithm that uses as an anomaly score the Euclidean distance between nearest neighbors of subsequences from a testing time series and a training time series is one of the most effective anomaly detectors. We investigate a very efficient implementation of this method and show that it is still too slow for most real world applications. Next, we present a new method based on summarizing the training time series with a small set of exemplars. The exemplars we use are feature vectors that capture both the high frequency and low frequency information in sets of similar subsequences of the time series. We show that this exemplar-based method is both much faster than the efficient brute force method as well as a prediction-based method and also handles a wider range of anomalies. We compare our algorithm across a large variety of publicly available time series and encourage others to do the same. Our exemplar-based algorithm is able to process time series in minutes that would take other methods days to process.