Abstract
In many time series applications, the data set under study is a vast stream of continuously updated data. Often those data arrive in bursts. Many examples are found in finance, telecommunications, physics, biology, astronomy, among others. The main motivation of our project is to infer linear relationships among multiple financial variables, yielding expressions of the form \(4*\mathrm{DJI} - 35*\mathrm{SNP}500 = 2.4*\mathrm{NASDAQ}\). We use such relationships to back-test a simple trading strategy. For the most part we based our analyses on FOREX data but we also experimented with non-financial datasets. Finally, we provide software capable of being used in a variety of generalized machine learning and streaming applications in many environments. The framework we developed is named StatLearn and is based on two fundamental blocks: SketchStream to filter for relevant time series (a reimplementation of StatStream) and LearnStream to make predictions. Thus, we provide machine learning algorithms in an on-line context.
To the memory of Lefteris’s father, Christos Soulas, who supported and guided Lefteris in every step of the way.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Frank, A. Asuncion, UCI Machine Learning Repository (2010). http://archive.ics.uci.edu/ml
R. Cole, D. Shasha, X. Zhao, Fast window correlations over uncooperative time series, in Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD’05, New York, NY, USA (ACM, New York, 2005), pp. 743–749
X. Zhao, High performance algorithms for multiple streaming time series. PhD thesis, New York, NY, USA, AAI3205697 (2006)
Y. Zhu, D. Shasha, Statstream: statistical monitoring of thousands of data streams in real time, in Proceedings of the 28th International Conference on Very Large Data Bases, VLDB’02, VLDB Endowment (2002), pp. 358–369
R. Agrawal, C. Faloutsos, A.N. Swami, Efficient similarity search in sequence databases, in Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms, FODO’93, London, UK, UK (Springer, Berlin, 1993), pp. 69–84
C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast subsequence matching in time-series databases. Technical report College Park, MD, USA (1993)
D. Rafiei, A. Mendelzon, Similarity-based queries for time series data. SIGMOD Rec. 26(2), 13–25 (1997)
K.-P. Chan, A.W.-C. Fu, Efficient time series matching by wavelets, in Proceedings of the 15th International Conference on Data Engineering, ICDE’99, Washington, DC, USA (IEEE Comput. Soc., Los Alamitos, 1999), p. 126
A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, M.J. Strauss, Surfing wavelets on streams: one-pass summaries for approximate aggregate queries, in VLDB (2001), pp. 79–88
F. Korn, H.V. Jagadish, C. Faloutsos, Efficiently supporting ad hoc queries in large datasets of time sequences, in SIGMOD (1997), pp. 289–300
E. Keogh, K. Chakrabarti, M. Pazzani, S. Mehrotra, Dimensionality reduction for fast similarity search in large time series databases. J. Knowl. Inf. Syst. 3, 263–286 (2000)
D. Achlioptas, Database-Friendly Random Projections (ACM, New York, 2001), pp. 274–281
W.B. Johnson, J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space (1982)
E. Kushilevitz, R. Ostrovsky, Y. Rabani, Efficient search for approximate nearest neighbor in high dimensional spaces, in Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC’98, New York, NY, USA (ACM, New York, 1998), pp. 614–623
P. Indyk, Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM 53(3), 307–323 (2006)
D. Shasha, Statstream pictorial architecture (2005). http://cs.nyu.edu/shasha/papers/statstream/architecture.html
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, E. Duchesnay, Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825–2830 (2011)
M. Kontaki, A.N. Papadopoulos, Efficient similarity search in streaming time sequences, in Proceedings of the 16th International Conference on Scientific and Statistical Database Management, SSDBM’04, Washington, DC, USA (IEEE Comput. Soc., Los Alamitos, 2004), p. 63
T. Buchgraber, D. Shutin, H.V. Poor, A sliding-window online fast variational sparse Bayesian learning algorithm, in ICASSP (2011), pp. 2128–2131
M. Velazco, A. Oliveira, C. Lyra, Neural networks give a warm start to linear optimization problems, in Proceedings of the 2002 International Joint Conference Neural Networks, IJCNN’02, vol. 2 (2002), pp. 1871–1876
R.S. Sutton, S.D. Whitehead, Online learning with random representations, in Proceedings of the Tenth International Conference on Machine Learning (Morgan Kaufmann, San Mateo, 1993), pp. 314–321
D. Saad (ed.), On-Line Learning in Neural Networks (Cambridge University Press, Cambridge, 1998)
C.C. Chang, S.S. Chen, R. Chou, C.W. Hsin, Intraday return spillovers and its variations across trading sessions. Rev. Quant. Finance Account. 36, 355–390 (2011)
C.M.C. Lee, B. Mucklow, M.J. Ready, Spreads, depths, and the impact of earnings information: an intraday analysis. Rev. Financ. Stud. 6(2), 345–374 (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Soulas, E., Shasha, D. (2016). Fast Methods for Statistical Arbitrage. In: Garofalakis, M., Gehrke, J., Rastogi, R. (eds) Data Stream Management. Data-Centric Systems and Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28608-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-28608-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28607-3
Online ISBN: 978-3-540-28608-0
eBook Packages: Computer ScienceComputer Science (R0)