Abstract
Algorithmic trading strategies are automated defining a sequence of instructions executed by a computer. A good strategy should be profitable which includes identification of what to trade and how to trade. In this paper, we focus on the study of algorithmic trading strategy optimization and propose a strategy optimization model based on an initialized strategy pool. In order to get a better strategy, a mutual information entropy based clustering algorithm is employed to analyze the correlations among the stocks and a reward and punishment scheme is also set up for updating the latest transaction data in the strategy optimization process. Experimental results on several different groups of stocks showed that in most cases, this optimization model can find a profitable strategy swiftly.
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
van Bunningen, A.H.: Augmented Trading: from news articls to stock price prediction using syntactic analysis. Master’s thesis, University of Twente (2004)
Chen, S., Navet, N.: Pretests for genetic-programming evolved trading programs: “zero-intelligence” strategies and lottery trading. In: King, I., Wang, J., Chan, L.-W., Wang, D. (eds.) ICONIP 2006. LNCS, vol. 4234, pp. 450–460. Springer, Heidelberg (2006)
Choice, A.S.: Market risk and algorithmic trading. Tech. rep., AMD White Paper (2008)
Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley Series in Telecommunications and Signal Processing. Wiley-Interscience, Hoboken (2006)
Crammer, K., Kearns, M., Wortman, J.: Learning from multiple sources. Journal of Machine Learning Research 9, 1757–1774 (2008)
He, H., Chen, J., Jin, H., Chen, S.: Stock trend analysis and trading strategy. In: JCIS. Atlantis Press (2006)
Kakade, S., Kearns, M.J., Mansour, Y., Ortiz, L.E., Competitive, L.E.: algorithms for vwap and limit order trading. In: ACM Conference on Electronic Commerce, pp. 189–198 (2004)
Nevmyvaka, Y., Feng, Y., Kearns, M.: Reinforcement learning for optimized trade execution. In: ICML 2006, pp. 673–680 (2006)
Pranav, P., Eamonn, K., Jessica, L., Stefano, L.: Mining motifs in massive time series databases. In: Proceedings of IEEE International conference on data mining, pp. 370–377 (2002)
Rakesh, A., Christos, F., Arun, S.: Efficient similarity serach in sequence databases. In: Proceedings of 4th International Conference on Foundations of Data Organization and Algorithms, pp. 13–15 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, F., Dong, K., Deng, X. (2010). Algorithmic Trading Strategy Optimization Based on Mutual Information Entropy Based Clustering. In: Cai, Z., Hu, C., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2010. Lecture Notes in Computer Science, vol 6382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16493-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-16493-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16492-7
Online ISBN: 978-3-642-16493-4
eBook Packages: Computer ScienceComputer Science (R0)