A Fast and Robust Method for Pattern Matching in Time Series Databases
暂无分享,去创建一个
[1] Eamonn J. Keogh,et al. A Probabilistic Approach to Fast Pattern Matching in Time Series Databases , 1997, KDD.
[2] C. Lawson. Characteristic properties of the segmented rational minmax approximation problem , 1964 .
[3] Theodosios Pavlidis,et al. Waveform Segmentation Through Functional Approximation , 1973, IEEE Transactions on Computers.
[4] Theodosios Pavlidis,et al. Segmentation of Plane Curves , 1974, IEEE Transactions on Computers.
[5] Clu-istos Foutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[6] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.
[7] Hagit Shatkay,et al. Approximate queries and representations for large data sequences , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[8] Rui J. P. de Figueiredo,et al. Structural processing of waveforms as trees , 1990, IEEE Trans. Acoust. Speech Signal Process..
[9] Donald J. Berndt,et al. Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.
[10] Kyuseok Shim,et al. Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.
[11] Kaizhong Zhang,et al. A System for Approximate Tree Matching , 1994, IEEE Trans. Knowl. Data Eng..
[12] Roger W. Ehrich,et al. Representation of Random Waveforms by Relational Trees , 1976, IEEE Transactions on Computers.