The Market Fraction Hypothesis under different GP algorithms

In a previous work, inspired by observations made in many agent-based financial models, we formulated and presented the Market Fraction Hypothesis, which basically predicts a short duration for any dominant type of agents, but then a uniform distribution over all types in the long run. We then proposed a two-step approach, a rule-inference step and a rule-clustering step, to testing this hypothesis. We employed genetic programming as the rule inference engine, and applied self-organizing maps to cluster the inferred rules. We then ran tests for 10 international markets and provided a general examination of the plausibility of the hypothesis. However, because of the fact that the tests took place under a GP system, it could be argued that these results are dependent on the nature of the GP algorithm. This chapter thus serves as an extension to our previous work. We test the Market Fraction Hypothesis under two new different GP algorithms, in order to prove that the previous results are rigorous and are not sensitive to the choice of GP. We thus test again the hypothesis under the same 10 empirical datasets that were used in our previous experiments. Our work shows that certain parts of the hypothesis are indeed sensitive on the algorithm. Nevertheless, this sensitivity does not apply to all aspects of our tests. This therefore allows us to conclude that our previously derived results are rigorous and can thus be generalized

Forecasting stock prices using Genetic Programming and Chance Discovery

In recent years the computers have shown to be a powerful tool in financial forecasting. Many machine learning techniques have been utilized to predict movements in financial markets. Machine learning classifiers involve extending the past experiences into the future. However the rareness of some events makes difficult to create a model that detect them. For example bubbles burst and crashes are rare cases, however their detection is crucial since they have a significant impact on the investment. One of the main problems for any machine learning classifier is to deal with unbalanced classes. Specifically Genetic Programming has limitation to deal with unbalanced environments. In a previous work we described the Repository Method, it is a technique that analyses decision trees produced by Genetic Programming to discover classification rules. The aim of that work was to forecast future opportunities in financial stock markets on situations where positive instances are rare. The objective is to extract and collect different rules that classify the positive cases. It lets model the rare instances in different ways, increasing the possibility of identifying similar cases in the future. The objective of the present work is to find out the factors that work in favour of Repository Method, for that purpose a series of experiments was performed.Forecasting, Chance discovery, Genetic programming, machine learning

CES-511 The Market Fraction Hypothesis under different GP algorithms

In a previous work, inspired by observations made in many agent-based financial models, we formulated and presented the Market Fraction Hypothesis, which basically predicts a short duration for any dominant type of agents, but then a uniform distribution over all types in the long run. We then proposed a two-step approach, a rule-inference step and a rule-clustering step, to testing this hypothesis. We employed genetic programming as the rule in- ference engine, and applied self-organizing maps to cluster the inferred rules. We then ran tests for 10 international markets and provided a general examination of the plausibility of the hypothesis. However, because of the fact that the tests took place under a GP system, it could be argued that these results are dependent on the nature of the GP algorithm. This chapter thus serves as an extension to our previous work. We test the Market Fraction Hypothesis under two new different GP algorithms, in order to prove that the previous results are rigorous and are not sensitive to the choice of GP. We thus test again the hypothesis under the same 10 empirical datasets that were used in our previous experiments. Our work shows that certain parts of the hypothesis are indeed sensitive on the algorithm. Nevertheless, this sensitivity does not apply to all aspects of our tests. This therefore allows us to conclude that our previously derived results are rigorous and can thus be generalized

Spartan Daily, June 4, 1948

Volume 36, Issue 151https://scholarworks.sjsu.edu/spartandaily/11109/thumbnail.jp

Sandspur, Vol. 46 No. 25, April 23, 1941

Rollins College student newspaper, written by the students and published at Rollins College. The Sandspur started as a literary journal.https://stars.library.ucf.edu/cfm-sandspur/1613/thumbnail.jp

Casco Bay Weekly : 17 September 1998

https://digitalcommons.portlandlibrary.com/cbw_1998/1039/thumbnail.jp