Abstract
Finding motifs of financial data streams in real time is a very interesting and valuable work. We hope to find the motif existing in financial data streams on local trend subsequence. A stock market trader might use such a tool to spot arbitrage opportunities or escape the underlying venture. The paper introduces a novel distance measurement, that is SDD (Slope Duration Distance), for local subsequences. At the same time, we propose an efficient algorithm of motif discovery over a great deal of financial data streams, that is PMDGS (P-Motif Discovery based on Grid Structure), which make use of PLA (Piecewise Linear Approximation) technology and grid structure. Extensive experiments on synthetic data and real world financial trading data show that our model provides several orders of magnitude performance improvement relative to traditional naive linear scan techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, pp. 69–74. Springer, Heidelberg (1993)
Berndt, D.J., Clifford, J.: Finding patterns in time series: a dynamic programming approach. In: Advances in Knowledge Discovery and Data Mining, pp. 229–248. AAAI Press, Menlo Park (1996)
Keogh, E.: Exact indexing of dynamic time warping. In: VLDB, pp. 406–417 (2002)
Patel, P., Keogh, E., Lin, J., Lonardi, S.: Mining Motifs in Massive Time Series Databases. In: ICDM, pp. 370–377 (2002)
Chiu, B., Keogh, E., Lonardi, S.: Probabilistic Discovery of Time Series Motifs. In: SIGKDD 2003, pp. 493–498 (2003)
Xi, X., Keogh, E., Li, W., Mafra-neto, A.: Finding Motifs in a Database of Shapes. In: Jonker, W., Petković, M. (eds.) SDM 2007. LNCS, vol. 4721, pp. 249–260. Springer, Heidelberg (2007)
Yankov, D., Keogh, E., Medina, J., Chiu, B., Zordan, V.: Detecting Time Series Motifs Under Uniform Scaling. In: SIGKDD, pp. 844–853 (2007)
Chen, Q., Chen, L., Lian, X., et al.: Indexable PLA for Efficient Similarity Search. In: VLDB, pp. 435–446 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, T., Feng, Y., Zhang, B., Shi, J., Wang, Y. (2008). Finding Motifs of Financial Data Streams in Real Time. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2008. Lecture Notes in Computer Science, vol 5370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92137-0_60
Download citation
DOI: https://doi.org/10.1007/978-3-540-92137-0_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92136-3
Online ISBN: 978-3-540-92137-0
eBook Packages: Computer ScienceComputer Science (R0)