Dynamic Adaptive Algorithm Selection: Profit Maximization for Online Trading
- Cite this paper as:
- 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
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 () 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 wi are analyzed and the decision making module determines the best suitable algorithm for next window wi + 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.
KeywordsBusiness applications of artificial intelligence Business Intelligence Online Trading Adaptive Algorithms
Unable to display preview. Download preview PDF.