Discovering Subdimensional Motifs of Different Lengths in Large-Scale Multivariate Time Series Article Swipe

MAKE IMPACT

Yifeng Gao , Jessica Lin · YOU? · · 2019 · Open Access · · DOI: https://doi.org/10.48550/arxiv.1911.09218

Detecting repeating patterns of different lengths in time series, also called variable-length motifs, has received a great amount of attention by researchers and practitioners. Despite the significant progress that has been made in recent single dimensional variable-length motif discovery work, detecting variable-length \textit{subdimensional motifs}---patterns that are simultaneously occurring only in a subset of dimensions in multivariate time series---remains a difficult task. The main challenge is scalability. On the one hand, the brute-force enumeration solution, which searches for motifs of all possible lengths, is very time consuming even in single dimensional time series. On the other hand, previous work show that index-based fixed-length approximate motif discovery algorithms such as random projection are not suitable for detecting variable-length motifs due to memory requirement. In this paper, we introduce an approximate variable-length subdimensional motif discovery algorithm called \textbf{C}ollaborative \textbf{HI}erarchy based \textbf{M}otif \textbf{E}numeration (CHIME) to efficiently detect variable-length subdimensional motifs given a minimum motif length in large-scale multivariate time series. We show that the memory cost of the approach is significantly smaller than that of random projection. Moreover, the speed of the proposed algorithm is significantly faster than that of the state-of-the-art algorithms. We demonstrate that CHIME can efficiently detect meaningful variable-length subdimensional motifs in large real world multivariate time series datasets.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/1911.09218

PDF

https://arxiv.org/pdf/1911.09218

OA Status

green

Cited By

2

References

26

Related Works

10

OpenAlex ID

https://openalex.org/W2990500758

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W2990500758

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.48550/arxiv.1911.09218

Digital Object Identifier

Title

Discovering Subdimensional Motifs of Different Lengths in Large-Scale Multivariate Time Series

Work title

Type

preprint

OpenAlex work type

Language

en

Primary language

Publication year

2019

Year of publication

Publication date

2019-11-20

Full publication date if available

Authors

Yifeng Gao, Jessica Lin

List of authors in order

Landing page

https://arxiv.org/abs/1911.09218

Publisher landing page

PDF URL

https://arxiv.org/pdf/1911.09218

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/1911.09218

Direct OA link when available

Concepts

Multivariate statistics, Random projection, Scalability, Series (stratigraphy), Variable (mathematics), Algorithm, Motif (music), Enumeration, Computer science, Mathematics, Combinatorics, Statistics, Biology, Mathematical analysis, Database, Acoustics, Paleontology, Physics

Top concepts (fields/topics) attached by OpenAlex

Cited by

2

Total citation count in OpenAlex

Citations by year (recent)

2025: 1, 2020: 1

Per-year citation counts (last 5 years)

References (count)

26

Number of works referenced by this work

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload