Abstract

A common challenge in multimedia data understanding is the unsupervised discovery of recurring patterns, or motifs, in time series data. The discovery of motifs in uni-variate time series is a well studied problem and, while being a relatively new area of research, there are also several proposals for multi-variate motif discovery. Unfortunately, motif search among multiple variates is an expensive process, as the potential number of sub-spaces in which a pattern can occur increases exponentially with the number of variates. Consequently, many multi-variate motif search algorithms make simplifying assumptions, such as searching for motifs across all variates individually, assuming that the motifs are of the same length, or that they occur on a fixed subset of variates. In this paper, we are interested in addressing a relatively broad form of multi-variate motif detection, which seeks frequently occurring patterns (of possibly differing lengths) in sub-spaces of a multi-variate time series. In particular, we aim to leverage contextual information to help select contextually salient patterns and identify the most frequent patterns among all. Based on these goals, we first introduce the contextually salient multi-variate motif (CS-motif) discovery problem and then propose a salient multi-variate motif (SMM) algorithm that, unlike existing methods, is able to seek a broad range of patterns in multi-variate time series.

Highlights

  • A key challenge in multimedia data mining is the unsupervised discovery of recurring patterns in time series data

  • InTable 3, before presenting the detailed accuracy results—from Tables 4–6, we present a set of representative results, comparing accuracies for the salient multi-variate motif (SMM)-s and matrix profile with clustering (MPC)

  • Comparing the results reported in this table with the default results in Table 4, we can seen that both algorithms are robust against repeating motif instance counts; on the other hand, the results indicate that SMM-s is significantly more accurate than MPC when subsequence lengths are allowed to be flexible ( f = 50–100%)

Read more

Summary

Introduction

A key challenge in multimedia (e.g., video [1,2] and sensor [3]) data mining is the unsupervised discovery of recurring patterns in time series data. We focus on the efficient and accurate identification of frequently recurrent patterns, motifs, in multivariate time series. The discovery of such motifs in uni-variate time series is a well-studied problem [4]. In most multimedia applications, the resulting time series are multi-variate; applications require multi-variate motifs.

Objectives
Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call