Abstract
Online trading algorithms can facilitate the investment decisions in financial markets. This paper presents a dynamic adaptive algorithm selection framework for online trading with the goal of maximizing overall revenue (lower competitive ratio). We integrate the algorithm selection ([1]) and probabilistic graphs to transform the algorithm selection model of offline algorithms for a dynamically adaptive model of online trading. Unlike the traditional static approach of algorithm selection, where a single algorithm is executed over the whole investment horizon, we dynamically select and update the trading algorithm by analyzing the time series features. The time series is partitioned in different windows and each window’s features are extracted sequentially using real time hybrid pattern matching approach. The extracted features of current window w i are analyzed and the decision making module determines the best suitable algorithm for next window w i + 1 on the basis of underlying probabilistic graphical model. The process is repeated until all windows in a time series are processed. Our dynamic adaptive algorithm selection model outperforms the static model on real world datasets of DAX30 and S&P500.
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.
Similar content being viewed by others
References
Rice, J.R.: The algorithm selection problem. Advances in Computers 15, 65–118 (1976)
El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal search and one-way trading algorithm. Algorithmica 30, 101–139 (2001)
Zhang, Z., Jiang, J., Liu, X., Lau, R., Wang, H., Zhang, R.: A real time hybrid pattern matching scheme for stock time series. In: Proceedings of the Twenty-First Australasian Conference on Database Technologies, ADC 2010, vol. 104, pp. 161–170. Australian Computer Society, Inc., Darlinghurst (2010)
Potkonjak, M., Rabaey, J.: Algorithm selection: a quantitative computation-intensive optimization approach. In: ICCAD 1994: Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, pp. 90–95. IEEE Computer Society Press, Los Alamitos (1994)
Lagoudakis, M.G., Littman, M.L.: Algorithm selection using reinforcement learning. In: Proceedings of the Seventeenth International Conference on Machine Learning, ICML 2000, pp. 511–518. Morgan Kaufmann Publishers Inc., San Francisco (2000)
Hazan, E., Seshadhri, C.: Adaptive algorithms for online decision problems. Electronic Colloquium on Computational Complexity (ECCC) 14(088) (2007)
Gagliolo, M., Zhumatiy, V., Schmidhuber, J.: Adaptive online time allocation to search algorithms, pp. 134–143 (2004)
Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: portfolio-based algorithm selection for sat. J. Artif. Int. Res. 32, 565–606 (2008)
Ewald, R., Himmelspach, J., Uhrmacher, A.M.: An algorithm selection approach for simulation systems. In: Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation, PADS 2008, pp. 91–98. IEEE Computer Society, Washington, DC (2008)
Jordan, M.I.: Graphical models. Statistical Science (Special Issue on Bayesian Statistics) 19, 140–155 (2004)
Lorenz, J., Panagiotou, K., Steger, A.: Optimal algorithms for k-search with application in option pricing. Algorithmica 55(2), 311–328 (2009)
Chen, G.-H., Kao, M.-Y., Lyuu, Y.-D., Wong, H.-K.: Optimal buy-and-hold strategies for financial markets with bounded daily returns. SIAM Journal on Computing 31(2), 447–459 (2001)
Hu, S., Guo, Q., Li, H.: Competitive Analysis of On-line Securities Investment. In: Megiddo, N., Xu, Y., Zhu, B. (eds.) AAIM 2005. LNCS, vol. 3521, pp. 224–232. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahmad, I., Iqbal, J., Schmidt, G. (2012). Dynamic Adaptive Algorithm Selection: Profit Maximization for Online Trading. In: Abramowicz, W., Kriksciuniene, D., Sakalauskas, V. (eds) Business Information Systems. BIS 2012. Lecture Notes in Business Information Processing, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30359-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-30359-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30358-6
Online ISBN: 978-3-642-30359-3
eBook Packages: Computer ScienceComputer Science (R0)