2009
DOI: 10.1007/s00354-009-0068-x
|View full text |Cite
|
Sign up to set email alerts
|

Constrained Motif Discovery in Time Series

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 38 publications
(23 citation statements)
references
References 15 publications
0
23
0
Order By: Relevance
“…The proposed technique treats a statistic as a text document and extracts native segments from the time series as words. Yasser et al [7] described the problem of Constrained Motif Detectionusingtwo approaches. MC-Full and MC-Inc has been utilized for solving the constrained motif detection issues in a more effective way.…”
Section: IImentioning
confidence: 99%
“…The proposed technique treats a statistic as a text document and extracts native segments from the time series as words. Yasser et al [7] described the problem of Constrained Motif Detectionusingtwo approaches. MC-Full and MC-Inc has been utilized for solving the constrained motif detection issues in a more effective way.…”
Section: IImentioning
confidence: 99%
“…Landmarks can be used to break time series into meaningful segments, which are also referred to as key-points [8], breakpoints [47] and change-points [37]. Perng et al [43] propose a feature-based technique, which uses landmarks instead of the raw data for processing.…”
Section: Related Workmentioning
confidence: 99%
“…A considerable number of such methods have been proposed in the past, including Symbolic Aggregate approXimation (SAX) [29], bit-level approximation [7], and Piecewise Aggregate Approximation (PAA) [25]. 1 In this paper specifically, we focus on the representation of time series by means of landmarks [43] (also referred to as key-points [8], break-points [47] and change-points [37]), which can be thought of as those points in the time series that are obviously remarkable (peaks, valleys, inflection points, …). Rather than matching every detail of the data and the template, only the landmarks will be matched, and subsequent landmarks will be checked for their relationship to one another.…”
Section: Introductionmentioning
confidence: 99%
“…The motifs are discovered in linear time and constant memory costs using random sampling. However, this approach can lead to poor performance for long time series with infrequent motifs [13].…”
Section: Definition 5 Frequent K-motifsmentioning
confidence: 99%