Loading…

KfreqGAN: Unsupervised detection of sequence anomaly with adversarial learning and frequency domain information

Sequence anomaly detection in time series is of critical importance to wide applications ranging from finance, healthcare to IT system monitoring. Most current researches use the reconstruction-based deep learning algorithms to solve the problem. In this article, we aim to use a prediction-based met...

Full description

Saved in:
Bibliographic Details
Published in:Knowledge-based systems 2022-01, Vol.236, p.107757, Article 107757
Main Authors: Yao, Yueyue, Ma, Jianghong, Ye, Yunming
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Sequence anomaly detection in time series is of critical importance to wide applications ranging from finance, healthcare to IT system monitoring. Most current researches use the reconstruction-based deep learning algorithms to solve the problem. In this article, we aim to use a prediction-based method to detect sequence anomalies in univariate time series, because the latter methods can detect anomalies using historical information revealing normal patterns in time series whereas the former methods simply consider current sequences. However, it is challenging because there exists both uncertainty in the future and performance deterioration under long detection horizon. To tackle the challenges, we propose an unsupervised algorithm called KfreqGAN, which is based on adversarially trained sequence predictor. The adversarial learning architecture helps the model make accurate predictions for future sequences. In addition, auxiliary information from frequency domain is used to help the model capture the characteristics of time series for achieving satisfactory predictions. We conduct extensive experiments on two public-available datasets, with results demonstrating the effectiveness of the proposed algorithm and its superiority to baseline algorithms.
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2021.107757