|
[1] Agrawal, R., Faloutsos, C., and Swami, A. (1993). Efficient Similarity Search in Sequence Databases. FODO, 730, 69-84. [2] Bollinger, J. (2001). Bollinger on Bollinger Bands. McGraw-Hill, New York. [3] Chan, K. and Fu, W. (1999). Efficient time series matching by wavelets. ICDE, 126-133. [4] Conover, W. J. (1999). Practical nonparametric statistics. Wiley, New York. [5] Hirschberg, D. S. (1977). Algorithm for the Longest Common Subsequence Problem. Journal of ACM, 24, 4, 664-675. [6] Jones, N. C. and Pevzner, P. A. (2004). An Introduction to Bioinformatics Algorithms. MIT Press, Cambridge, Mass. [7] Keogh, E. J., Chu, S., Hart, D., and Pazzani M. J. (2001). An Online Algorithm for Segmenting Time Series. In ICDM, 289-296. [8] Tsay, R. S. (2002). Analysis of Financial Time Series. Wiley, New York. [9] Wei, W. W. S. (1990). Time Series Analysis. Addison-Wesley, Redwood City. [10] Wu, H., Salzberg, B. ,and Zhang, D. (2004). Online Event-driven Subsequence Matching over Financial Data Streams. SIGMOD, 23-34. [11] Yan, B. and Zivot, E. (2003). Analysis of High-frequency Financial Data with S-Plus. Department of Economics, University of Washington.
|