Multiresolution Motif Discovery in Time Series

More documents

Recommendations

Info

IV – Our algorithm Problem definition • We follow a Top-K frequent pattern approach: • i.e. finding the Top-K motifs • A time series can be counted as a repetition of another if they have the same symbolic representation • We use the Symbolic Aggregate Approximation (iSAX*) * Shieh, J. and Keogh, E., iSAX: indexing and mining terabyte sized time series, in Proceedings of the 14th ACM SIGKDD international Conference on Knowledge Discovery and Data Mining (2008), pp. 623-631. Nuno Castro and Paulo Azevedo 04/30/2010
IV – Our algorithm – Problem definition iSAX • State of the art time series representation technique • Widely used in time series data mining • Converts a time series to a sequence of symbols (word) • Given a resolution (alphabet size) and word size Image generated by MATLAB and code provided by iSAX authors Nuno Castro and Paulo Azevedo 04/30/2010
Page 1 and 2: Tenth SIAM International Conference
Page 3 and 4: I - Motif Definition • Motifs, al
Page 5 and 6: III - Related work limitations •
Page 7: IV - Our algorithm • We propose a
Page 11 and 12: IV - Our algorithm Problem definiti
Page 13 and 14: IV - Our algorithm Properties • M
Page 15 and 16: IV - Our algorithm - Properties Mul
Page 17 and 18: IV - Our algorithm - Properties Spa
Page 19 and 20: V - Experimental Analysis • Scala
Page 21 and 22: V - Experimental Analysis - Scalabi
Page 23 and 24: V - Experimental Analysis - Scalabi
Page 25 and 26: V - Experimental Analysis Experimen
Page 27 and 28: VI - Conclusions • We have introd
Page 29 and 30: Thank you for your attention! • C
Page 31: On similarity Nuno Castro and Paulo

Multiresolution Motif Discovery in Time Series

Create successful ePaper yourself

Delete template?

Save as template?