{"title":"Time series representation for anomaly detection","authors":"M. Leng, Xinsheng Lai, Guolv Tan, Xiaohui Xu","doi":"10.1109/ICCSIT.2009.5234775","DOIUrl":null,"url":null,"abstract":"Anomaly detection in time series has attracted a lot of attention in the last decade, and is still a hot topic in time series mining. However, time series are high dimensional and feature correlational, directly detecting anomaly patterns in its raw format is very expensive, in addition, different time series may have different lengths of anomaly patterns, and usually, the lengths of anomaly patterns is unknown. This paper presents a new conception key point and an algorithm of seeking key points, the algorithm uses key points to rerepresent time series and still preserves its fundamental characteristics. Variable length method was used to segment re-represented time series into patterns and calculate anomaly scores of patterns. Anomaly patterns are identified by their anomaly scores automatically. The effectiveness of representational algorithm and anomaly detecting algorithm are demonstrated with both synthetic and standard datasets, and the experimental results confirm that our methods can identify anomaly patterns with different lengths and improve the speed of detecting algorithm greatly.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 2nd IEEE International Conference on Computer Science and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSIT.2009.5234775","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22
Abstract
Anomaly detection in time series has attracted a lot of attention in the last decade, and is still a hot topic in time series mining. However, time series are high dimensional and feature correlational, directly detecting anomaly patterns in its raw format is very expensive, in addition, different time series may have different lengths of anomaly patterns, and usually, the lengths of anomaly patterns is unknown. This paper presents a new conception key point and an algorithm of seeking key points, the algorithm uses key points to rerepresent time series and still preserves its fundamental characteristics. Variable length method was used to segment re-represented time series into patterns and calculate anomaly scores of patterns. Anomaly patterns are identified by their anomaly scores automatically. The effectiveness of representational algorithm and anomaly detecting algorithm are demonstrated with both synthetic and standard datasets, and the experimental results confirm that our methods can identify anomaly patterns with different lengths and improve the speed of detecting algorithm greatly.