Abstract
Over the last decade, numerous papers have investigated the use of GP for creating financial trading strategies. Typically in the literature results are inconclusive but the investigators always suggest the possibility of further improvements, leaving the conclusion regarding the effectiveness of GP undecided. In this paper, we discuss a series of pretests, based on several variants of random search, aiming at giving more clear-cut answers on whether a GP scheme, or any other machine-learning technique, can be effective with the training data at hand. The analysis is illustrated with GP-evolved strategies for three stock exchanges exhibiting different trends. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Chen, S. H., & Navet, N. (2006). Pretests for genetic-programming evolved trading programs: “zero-intelligence” strategies and lottery trading. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4234 LNCS-III, pp. 450–460). Springer Verlag. https://doi.org/10.1007/11893295_50
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.