|
|
Improved expert selection model for forex trading |
Jia ZHU1, Xingcheng WU1, Jing XIAO1( ), Changqin HUANG1, Yong TANG1, Ke Deng2 |
1. School of Computer Science, South China Normal University, Guangzhou 510631, China 2. School of Computer Science and Information Technology, Royal Melbourne Institute of Technology, Melbourne 3000, Australia |
|
|
Abstract Online prediction is a process that repeatedly predicts the next element in the coming period from a sequence of given previous elements. This process has a broad range of applications in various areas, such as medical, streaming media, and finance. The greatest challenge for online prediction is that the sequence data may not have explicit features because the data is frequently updated, which means good predictions are difficult to maintain. One of the popular solutions is to make the prediction with expert advice, and the challenge is to pick the right experts with minimum cumulative loss. In this research, we use the forex trading prediction, which is a good example for online prediction, as a case study. We also propose an improved expert selection model to select a good set of forex experts by learning previously observed sequences. Our model considers not only the average mistakes made by experts, but also the average profit earned by experts, to achieve a better performance, particularly in terms of financial profit. We demonstrate the merits of our model on two real major currency pairs corpora with extensive experiments.
|
Keywords
online learning
expert selection
forex prediction
|
Corresponding Author(s):
Jing XIAO
|
Just Accepted Date: 28 March 2017
Online First Date: 27 November 2017
Issue Date: 02 May 2018
|
|
1 |
Deshpande M, Karypis G. Evaluation of techniques for classifying biological sequences. In: Proceedings of Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining. 2002, 417–431
https://doi.org/10.1007/3-540-47887-6_41
|
2 |
Duskin O, Feitelson D G. Distinguishing humans from robots in web search logs: preliminary results using query rates and intervals. In: Proceedings of the Workshop on Web Search Click Data. 2009, 15–19
https://doi.org/10.1145/1507509.1507512
|
3 |
Kadous M W, Sammut C. Classification of multivariate time series and structured data using constructive induction. Machine Learning, 2005, 58(2): 179–216
https://doi.org/10.1007/s10994-005-5826-5
|
4 |
Liu X, Zhang P Z, Zeng D J. Sequence matching for suspicious activity detection in anti-money laundering. In: Proceedings of IEEE ISI International Workshops on Intelligence and Security Informatics. 2008, 50–61
https://doi.org/10.1007/978-3-540-69304-8_6
|
5 |
Tan P N, Kumar V. Discovery of web robot sessions based on their navigational patterns. Data Mining and Knowledge Discovery, 2002, 6(1): 9–35
https://doi.org/10.1023/A:1013228602957
|
6 |
Wang J G, Huang J Z, Guo J F, Lan Y Y. Recommending high-utility search engine queries via a query-recommending model. Neurocomputing, 2015, 167(1): 195–208
https://doi.org/10.1016/j.neucom.2015.04.076
|
7 |
Huang X, Cheng H, Li R H, Qin L, Yu J X. Top-k structural diversity search in large networks. Proceedings of the VLDB Endowment, 2013, 6(13): 1618–1629
https://doi.org/10.14778/2536258.2536272
|
8 |
Hutter M. On the foundations of universal sequence prediction. In: Proceedings of International Conference on Theory and Applications of Models of Computation. 2006, 408–420
https://doi.org/10.1007/11750321_39
|
9 |
Kaj L N. Application of a simple likelihood ratio approximant to protein sequence classification. Bioinformatics, 2006, 22(23): 2865–2869
https://doi.org/10.1093/bioinformatics/btl512
|
10 |
Wang J L, Zhao P L, Hoi S C H. Cost-sensitive online classification. IEEE Transactions on Knowledge and Data Engineering, 2014, 26(10): 2425–2438
https://doi.org/10.1109/TKDE.2013.157
|
11 |
Zhu Z X, Xiao J, Li J Q, Wang F X, Zhang Q F. Global path planning of wheeled robots using multi-objective memetic algorithms. Integrated Computer-Aided Engineering, 2015, 22(4): 387–404
https://doi.org/10.3233/ICA-150498
|
12 |
Mao R, Xu H L, Wu W B, Li J Q, Li Y, Lu M H. Overcoming the challenge of variety: big data abstraction, the next evolution of data management for aal communication systems. IEEE Communications Magazine, 2015, 53(1): 42–47
https://doi.org/10.1109/MCOM.2015.7010514
|
13 |
Wang J L, Zhao P L, Hoi S C H, Jin R. Online feature selection and its applications. IEEE Transactions on Knowledge and Data Engineering, 2006, 26(3): 698–710
https://doi.org/10.1109/TKDE.2013.32
|
14 |
Mao R, Zhang P H, Li X L, Liu X, Lu M H. Pivot selection for metricspace indexing. International Journal of Machine Learning and Cybernetics, 2016, 7(2): 311–323
https://doi.org/10.1007/s13042-016-0504-4
|
15 |
Lu M H, Tang Y N, Sun R C, Wang T F, Chen S P, Mao R. A real time displacement estimation algorithm for ultrasound elastography. Computers in Industry, 2015, 69(1): 61–71
https://doi.org/10.1016/j.compind.2014.09.006
|
16 |
Li J Q, Liu C C, Liu B, Mao R, Wang Y C, Chen S, Yang J J, Pan H, Wang Q. Diversity-aware retrieval of medical records. Computers in Industry, 2015, 69(1): 81–91
https://doi.org/10.1016/j.compind.2014.09.004
|
17 |
Zheng K, Zhou X F, Fung P C, Xie K X. Spatial query processing for fuzzy objects. The VLDB Journal, 2012, 21(5): 1–23
https://doi.org/10.1007/s00778-012-0266-x
|
18 |
Littlestone N, Warmuth M K. The weighted majority algorithm. In: Proceedings of Symposium on Foundations of Computer Science. 1989, 256–261
https://doi.org/10.1109/SFCS.1989.63487
|
19 |
Littlestone N. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. In: Proceedings of Symposium on Foundations of Computer Science. 1987, 68–77
https://doi.org/10.1109/SFCS.1987.37
|
20 |
Rosenblatt F. The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review, 1958, 65(6): 386
https://doi.org/10.1037/h0042519
|
21 |
Valiant L G. A theory of the learnable. Communications of the ACM, 1984, 27(11): 1134–1142
https://doi.org/10.1145/1968.1972
|
22 |
Blum A. Separating distribution-free and mistake-bound learning models over the boolean domain. In: Proceedings of Symposium on Foundations of Computer Science. 1990, 211–218
https://doi.org/10.1109/FSCS.1990.89540
|
23 |
Widrow B, Hoff M E. Adaptive Switching Circuits. Cambridge: MIT Press, 1988
|
24 |
Wei L, Keogh E. Semi-supervised time series classification. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2006, 748–753
https://doi.org/10.1145/1150402.1150498
|
25 |
Xi X P, Keogh E, Shelton C, Wei L, Ratanamahatana C A. Fast time series classification using numerosity reduction. In: Proceedings of the 23rd International Conference on Machine learning. 2006, 1033–1040
https://doi.org/10.1145/1143844.1143974
|
26 |
Lewis D D. Naive (bayes) at forty: the independence assumption in information retrieval. In: Proceedings of European Conference on Machine Learning. 1998, 4–15
https://doi.org/10.1007/BFb0026666
|
27 |
Yakhnenko O, Silvescu A, Honavar V. Discriminatively trained markov model for sequence classification. In: Proceedings of IEEE International Conference on Data Mining. 2005, 498–505
https://doi.org/10.1109/ICDM.2005.52
|
28 |
Eban E, Birnbaum A, Shalev-Shwartz S, Globerson A. Learning the experts for online sequence prediction. In: Proceedings of the International Conference on Machine learning. 2012, 125–133
|
29 |
Cesa-Bianchi N, Freund Y, Haussler D, Helmbold D P, Schapire R E, Warmuth M K. How to use expert advice. Journal of the ACM, 1997, 44(3): 427–485
https://doi.org/10.1145/258128.258179
|
30 |
Foster D P, Vohra R V. A randomization rule for selecting forecasts. Operations Research, 1993, 41(4): 704–709
https://doi.org/10.1287/opre.41.4.704
|
31 |
Abernethy J, Bartlett P, Rakhlin A. Multitask learning with expert advice. In: Proceedings of International Conference on Computational Learning Theory. 2007, 484–498
https://doi.org/10.1007/978-3-540-72927-3_35
|
32 |
Avidan S. Ensemble tracking. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007, 29(2): 261–271
https://doi.org/10.1109/TPAMI.2007.35
|
33 |
Yu C N J, Joachims T. Learning structural svms with latent variables. In: Proceedings of the 26th Annual International Conference on Machine Learning. 2009, 1169–1176
https://doi.org/10.1145/1553374.1553523
|
34 |
Ron D, Singer Y, Tishby N. The power of amnesia: learning probabilistic automata with variable memory length. Machine Learning, 1996, 25(2): 117–149
https://doi.org/10.1023/A:1026490906255
|
35 |
Zhao P, Hoi S, Zhuang J. Active learning with expert advice. In: Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence. 2013, 704–713
|
36 |
Zhu J, Yang J, Xiao J, Huang C Q, Zhao G S, Tang Y. Online prediction for forex with an optimized experts selection model. In: Proceedings of Asia-Pacific Web Conference. 2016, 371–382
https://doi.org/10.1007/978-3-319-45814-4_30
|
37 |
Zheng K, Huang Z, Zhou O Y, Zhou X F. Discovering the most influential sites over uncertain data: a rank based approach. IEEE Transactions on Knowledge and Data Engineering, 2012, 24(12): 2156–2169
https://doi.org/10.1109/TKDE.2011.121
|
38 |
Zheng K, Su H, Zheng B L, Shang S, Xu J, Liu J, Zhou X F. Interactive top-k spatial keyword queries. In: Proceedings of the 31st IEEE International Conference on Data Engineering. 2015, 423–434
https://doi.org/10.1109/ICDE.2015.7113303
|
39 |
Vapnik V N. The nature of statistical learning theory. IEEE Transactions on Neural Networks, 1995, 8(6): 1564–1564
https://doi.org/10.1007/978-1-4757-2440-0
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|