A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
暂无分享,去创建一个
[1] Theodosios Pavlidis,et al. Waveform Segmentation Through Functional Approximation , 1973, IEEE Transactions on Computers.
[2] Pietro Perona,et al. Recognition of planar object classes , 1996, Proceedings CVPR IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[3] F. Attneave. Some informational aspects of visual perception. , 1954, Psychological review.
[4] Michael I. Jordan,et al. Probabilistic Independence Networks for Hidden Markov Probability Models , 1997, Neural Computation.
[5] Kyuseok Shim,et al. Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.
[6] Rui J. P. de Figueiredo,et al. Structural processing of waveforms as trees , 1990, IEEE Trans. Acoust. Speech Signal Process..
[7] Donald J. Berndt,et al. Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.
[8] Padhraic J. Smyth,et al. Hidden Markov models for fault detection in dynamic systems , 1993 .
[9] Clu-istos Foutsos,et al. Fast subsequence matching in time-series databases , 1994, SIGMOD '94.
[10] Kaizhong Zhang,et al. A System for Approximate Tree Matching , 1994, IEEE Trans. Knowl. Data Eng..