Matrix Profile for Anomaly Detection on Multidimensional Time Series

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Yeh, Chin-Chia Michael, Der, Audrey, Saini, Uday Singh, Lai, Vivian, Zheng, Yan, Wang, Junpeng, Dai, Xin, Zhuang, Zhongfang, Fan, Yujie, Chen, Huiyuan, Aboagye, Prince Osei, Wang, Liang, Zhang, Wei, Keogh, Eamonn
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866918432701677568
author Yeh, Chin-Chia Michael
Der, Audrey
Saini, Uday Singh
Lai, Vivian
Zheng, Yan
Wang, Junpeng
Dai, Xin
Zhuang, Zhongfang
Fan, Yujie
Chen, Huiyuan
Aboagye, Prince Osei
Wang, Liang
Zhang, Wei
Keogh, Eamonn
author_facet Yeh, Chin-Chia Michael
Der, Audrey
Saini, Uday Singh
Lai, Vivian
Zheng, Yan
Wang, Junpeng
Dai, Xin
Zhuang, Zhongfang
Fan, Yujie
Chen, Huiyuan
Aboagye, Prince Osei
Wang, Liang
Zhang, Wei
Keogh, Eamonn
contents The Matrix Profile (MP), a versatile tool for time series data mining, has been shown effective in time series anomaly detection (TSAD). This paper delves into the problem of anomaly detection in multidimensional time series, a common occurrence in real-world applications. For instance, in a manufacturing factory, multiple sensors installed across the site collect time-varying data for analysis. The Matrix Profile, named for its role in profiling the matrix storing pairwise distance between subsequences of univariate time series, becomes complex in multidimensional scenarios. If the input univariate time series has n subsequences, the pairwise distance matrix is a n x n matrix. In a multidimensional time series with d dimensions, the pairwise distance information must be stored in a n x n x d tensor. In this paper, we first analyze different strategies for condensing this tensor into a profile vector. We then investigate the potential of extending the MP to efficiently find k-nearest neighbors for anomaly detection. Finally, we benchmark the multidimensional MP against 19 baseline methods on 119 multidimensional TSAD datasets. The experiments covers three learning setups: unsupervised, supervised, and semi-supervised. MP is the only method that consistently delivers high performance across all setups. To ensure complete transparency and facilitate future research, our full Matrix Profile-based implementation, which includes newly added evaluations against the TSB-AD benchmark, is publicly available at: https://github.com/mcyeh/mmpad_tsb
format Preprint
id arxiv_https___arxiv_org_abs_2409_09298
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Matrix Profile for Anomaly Detection on Multidimensional Time Series
Yeh, Chin-Chia Michael
Der, Audrey
Saini, Uday Singh
Lai, Vivian
Zheng, Yan
Wang, Junpeng
Dai, Xin
Zhuang, Zhongfang
Fan, Yujie
Chen, Huiyuan
Aboagye, Prince Osei
Wang, Liang
Zhang, Wei
Keogh, Eamonn
Machine Learning
Artificial Intelligence
Databases
The Matrix Profile (MP), a versatile tool for time series data mining, has been shown effective in time series anomaly detection (TSAD). This paper delves into the problem of anomaly detection in multidimensional time series, a common occurrence in real-world applications. For instance, in a manufacturing factory, multiple sensors installed across the site collect time-varying data for analysis. The Matrix Profile, named for its role in profiling the matrix storing pairwise distance between subsequences of univariate time series, becomes complex in multidimensional scenarios. If the input univariate time series has n subsequences, the pairwise distance matrix is a n x n matrix. In a multidimensional time series with d dimensions, the pairwise distance information must be stored in a n x n x d tensor. In this paper, we first analyze different strategies for condensing this tensor into a profile vector. We then investigate the potential of extending the MP to efficiently find k-nearest neighbors for anomaly detection. Finally, we benchmark the multidimensional MP against 19 baseline methods on 119 multidimensional TSAD datasets. The experiments covers three learning setups: unsupervised, supervised, and semi-supervised. MP is the only method that consistently delivers high performance across all setups. To ensure complete transparency and facilitate future research, our full Matrix Profile-based implementation, which includes newly added evaluations against the TSB-AD benchmark, is publicly available at: https://github.com/mcyeh/mmpad_tsb
title Matrix Profile for Anomaly Detection on Multidimensional Time Series
topic Machine Learning
Artificial Intelligence
Databases
url https://arxiv.org/abs/2409.09298