Efficient subsequence matching for sequences databases under time warping
暂无分享,去创建一个
[1] Wesley W. Chu,et al. Efficient searches for similar subsequences of different lengths in sequence databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[2] W. Chu,et al. Fast retrieval of similar subsequences in long sequence databases , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).
[3] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[4] Eamonn J. Keogh,et al. Scaling up Dynamic Time Warping to Massive Dataset , 1999, PKDD.
[5] Sergios Theodoridis,et al. Pattern Recognition , 1998, IEEE Trans. Neural Networks.
[6] Alberto O. Mendelzon,et al. Similarity-based queries for time series data , 1997, SIGMOD '97.
[7] A. Guttman,et al. A Dynamic Index Structure for Spatial Searching , 1984, SIGMOD 1984.
[8] Biing-Hwang Juang,et al. Fundamentals of speech recognition , 1993, Prentice Hall signal processing series.
[9] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[10] Ada Wai-Chee Fu,et al. Efficient time series matching by wavelets , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).
[11] Sriram Padmanabhan,et al. Prefix-querying: an approach for effective subsequence matching under time warping in sequence databases , 2001, CIKM '01.
[12] Christos Faloutsos,et al. Efficient retrieval of similar time sequences under time warping , 1998, Proceedings 14th International Conference on Data Engineering.
[13] Man Hon Wong,et al. A Fast Projection Algorithm for Sequence Data Searching , 1998, Data Knowl. Eng..
[14] Eamonn J. Keogh,et al. Locally adaptive dimensionality reduction for indexing large time series databases , 2001, SIGMOD '01.
[15] Man Hon Wong,et al. Fast time-series searching with scaling and shifting , 1999, PODS '99.
[16] Eamonn J. Keogh,et al. Exact indexing of dynamic time warping , 2002, Knowledge and Information Systems.
[17] Man Hon Wong,et al. Efficient and robust feature extraction and pattern matching of time series by a lattice structure , 2001, CIKM '01.
[18] Christos Faloutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[19] Kyuseok Shim,et al. Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.
[20] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[21] Wesley W. Chu,et al. An index-based approach for similarity search supporting time warping in large sequence databases , 2001, Proceedings 17th International Conference on Data Engineering.
[22] Donald J. Berndt,et al. Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.