Discovery of time series $$k$$ k -motifs based on multidimensional index

Time series motifs are frequently occurring but previously unknown subsequences of a longer time series. Discovering time series motifs is a crucial task in time series data mining. In time series motif discovery algorithm, finding nearest neighbors of a subsequence is the basic operation. To make this basic operation efficient, we can make use of some advanced multidimensional index structure for time series data. In this paper, we propose two novel algorithms for discovering motifs in time series data: The first algorithm is based on $$\hbox {R}^{*}$$ R ∗ -tree and early abandoning technique and the second algorithm makes use of a dimensionality reduction method and state-of-the-art Skyline index. We demonstrate that the effectiveness of our proposed algorithms by experimenting on real datasets from different areas. The experimental results reveal that our two proposed algorithms outperform the most popular method, random projection, in time efficiency while bring out the same accuracy.

[1]  Ying Wu,et al.  Mining Motifs from Human Motion , 2008, Eurographics.

[2]  Eamonn J. Keogh,et al.  Locally adaptive dimensionality reduction for indexing large time series databases , 2001, SIGMOD '01.

[3]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[4]  Kuniaki Uehara,et al.  Discover Motifs in Multi-dimensional Time-Series Using the Principal Component Analysis and the MDL Principle , 2003, MLDM.

[5]  Eamonn J. Keogh,et al.  Probabilistic discovery of time series motifs , 2003, KDD '03.

[6]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[7]  Paulo J. Azevedo,et al.  Multiresolution Motif Discovery in Time Series , 2010, SDM.

[8]  Eugene Fink,et al.  Search for Patterns in Compressed Time Series , 2002, Int. J. Image Graph..

[9]  Eamonn J. Keogh,et al.  Exact Discovery of Time Series Motifs , 2009, SDM.

[10]  Eamonn J. Keogh,et al.  Finding Motifs in a Database of Shapes , 2007, SDM.

[11]  Chun-Ping Li,et al.  Stock temporal prediction based on time series motifs , 2009, 2009 International Conference on Machine Learning and Cybernetics.

[12]  Clu-istos Foutsos,et al.  Fast subsequence matching in time-series databases , 1994, SIGMOD '94.

[13]  Kuniaki Uehara,et al.  Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle , 2005, Machine Learning.

[14]  Stefan Conrad,et al.  Hidden markov model-based time series prediction using motifs for detecting inter-time-serial correlations , 2012, SAC '12.

[15]  Tuan Anh Duong,et al.  Time series similarity search based on Middle points and Clipping , 2011, 2011 3rd Conference on Data Mining and Optimization (DMO).

[16]  Duong Tuan Anh,et al.  Motif-Based Method for Initialization the K-Means Clustering for Time Series Data , 2011, Australasian Conference on Artificial Intelligence.

[17]  Eamonn J. Keogh,et al.  Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases , 2001, Knowledge and Information Systems.

[18]  Duong Tuan Anh,et al.  Discovering time series motifs based on multidimensional index and early abandoning , 2012, ICCCI 2012.

[19]  Quanzhong Li,et al.  Skyline index for time series data , 2004, IEEE Transactions on Knowledge and Data Engineering.

[20]  Stephen Shaoyi Liao,et al.  Discovering original motifs with different lengths from time series , 2008, Knowl. Based Syst..

[21]  Jeremy Buhler,et al.  Finding motifs using random projections , 2001, RECOMB.

[22]  Bernhard Sick,et al.  Signature Verification with Dynamic RBF Networks and Time Series Motifs , 2006 .

[23]  Paulo J. Azevedo,et al.  Mining Approximate Motifs in Time Series , 2006, Discovery Science.

[24]  Jessica Lin,et al.  Finding Motifs in Time Series , 2002, KDD 2002.

[25]  Eamonn J. Keogh,et al.  A symbolic representation of time series, with implications for streaming algorithms , 2003, DMKD '03.

[26]  Lars Schmidt-Thieme,et al.  Motif-Based Classification of Time Series with Bayesian Networks and SVMs , 2008, GfKl.

[27]  Eamonn J. Keogh,et al.  Detecting time series motifs under uniform scaling , 2007, KDD '07.

[28]  Eamonn J. Keogh,et al.  A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering , 2005, PAKDD.