Proceedings of the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery - DMKD '03 2003
DOI: 10.1145/882085.882086
|View full text |Cite
|
Sign up to set email alerts
|

A symbolic representation of time series, with implications for streaming algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
541
0
25

Year Published

2004
2004
2016
2016

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 725 publications
(567 citation statements)
references
References 0 publications
1
541
0
25
Order By: Relevance
“…It consists of two "for" cycles (lines 5-17 and 18-30, respectively), which allow one to enter the index from its root, and move towards the leaves, first vertically (i.e., according to the time granularity, see lines [5][6][7][8][9][10][11][12][13][14][15][16][17], and then horizontally (i.e., according to the taxonomy of symbols, see lines [18][19][20][21][22][23][24][25][26][27][28][29][30]. The descent towards the index leaves can stop: (1) because the query time granularity/symbol taxonomy level is reached (lines 16 and 29, respectively, which update the output set at level nodes), or (2) because the index leaves are reached, but the index is incomplete so that the query time granularity/symbol taxonomy level is too specific and is not represented in the index itself (lines 10 and 23, which update the output set higher nodes).…”
Section: Examplementioning
confidence: 99%
See 1 more Smart Citation
“…It consists of two "for" cycles (lines 5-17 and 18-30, respectively), which allow one to enter the index from its root, and move towards the leaves, first vertically (i.e., according to the time granularity, see lines [5][6][7][8][9][10][11][12][13][14][15][16][17], and then horizontally (i.e., according to the taxonomy of symbols, see lines [18][19][20][21][22][23][24][25][26][27][28][29][30]. The descent towards the index leaves can stop: (1) because the query time granularity/symbol taxonomy level is reached (lines 16 and 29, respectively, which update the output set at level nodes), or (2) because the index leaves are reached, but the index is incomplete so that the query time granularity/symbol taxonomy level is too specific and is not represented in the index itself (lines 10 and 23, which update the output set higher nodes).…”
Section: Examplementioning
confidence: 99%
“…Specifically, such strings are generated through a call to the build procedure, and saved in stringdummyset (line 7). Then, every string in stringdummyset is concatenated to all the elements already saved in out (lines [12][13][14][15][16][17][18][19]. On the other hand, if the current element e is a string (i.e., it is in the form SU B j , see Section 3.2), it is concatenated to all the elements already saved in out (lines [23][24][25][26][27][28][29][30][31][32][33][34][35].…”
Section: Examplementioning
confidence: 99%
“…This is the method used in SAX [51,52], which transforms a sequence of real numbers into a strings of characters, that can be classified using standard classification methods. Support vector machines have been successfully applied to time series data mining.…”
Section: Time Series Classificationmentioning
confidence: 99%
“…This approach extends SAX [51,52] adding new strings symbols. This representation is used for the task of classification of multivariate time series.…”
Section: Multivariate Time Series Classificationmentioning
confidence: 99%
“…In References [17,18], the authors describe a method for transforming real time series values into symbolic representations (the time axe is divided into intervals with the same length, and a symbol is given to each interval). This new representation was used for searching motifs in each parameter separately using on a probabilistic approach.…”
Section: 42mentioning
confidence: 99%