The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
Proceedings of the 2011 SIAM International Conference on Data Mining 2011
DOI: 10.1137/1.9781611972818.59
|View full text |Cite
|
Sign up to set email alerts
|

Time Series Motifs Statistical Significance

Abstract: Time series motif discovery is the task of extracting previously unknown recurrent patterns from time series data. It is an important problem within applications that range from finance to health. Many algorithms have been proposed for the task of efficiently finding motifs. Surprisingly, most of these proposals do not focus on how to evaluate the discovered motifs. They are typically evaluated by human experts. This is unfeasible even for moderately sized datasets, since the number of discovered motifs tends … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 38 publications
0
9
0
Order By: Relevance
“…Instead, we have assumed the same length for the pair of segments forming a motif pair. This assumption is well motivated, as practically all existing motif discovery algorithms operate under such constraint (e.g., Lin et al, 2002;Chiu et al, 2003;Tanaka et al, 2005;Mueen et al, 2009;Castro & Azevedo, 2011;Mueen, 2013;Yingchareonthawornchai et al, 2013). It is also motivated for the case where we are interested in pairs of segments of different length, as the most common way to compute the dissimilarity between such segments is by re-sampling them to have the same length.…”
Section: Resultsmentioning
confidence: 99%
“…Instead, we have assumed the same length for the pair of segments forming a motif pair. This assumption is well motivated, as practically all existing motif discovery algorithms operate under such constraint (e.g., Lin et al, 2002;Chiu et al, 2003;Tanaka et al, 2005;Mueen et al, 2009;Castro & Azevedo, 2011;Mueen, 2013;Yingchareonthawornchai et al, 2013). It is also motivated for the case where we are interested in pairs of segments of different length, as the most common way to compute the dissimilarity between such segments is by re-sampling them to have the same length.…”
Section: Resultsmentioning
confidence: 99%
“…So far, this had been done by meticulous visual inspection, which is bounded by the complexity of the data and the inherent biases of our perception. Relying on our time series representation, these explorations could be done using de-novo motif discovery algorithms, in which a sequence dataset is searched for statistically overrepresented segments in a fast, systematic, and unbiased manner [ 53 , 54 ]. Such modular decomposition approaches proved to be transformative in dealing with large volumes of data from sequencing and structural studies of DNA, RNA, and proteins [ 55 – 57 ].…”
Section: Discussionmentioning
confidence: 99%
“…Approximate fixed-length motif discovery is largely based upon random projection (CK Algorithm [14]) and Symbolic Aggregate Approximation or SAX [2,15] techniques (discussed further in Section 2.1.1). Of note is the use of iSAX in the MrMotif [16,17] algorithm that derives a set of top-K motifs for a fixed length through increasing SAX resolutions.…”
Section: Literature Reviewmentioning
confidence: 99%