|
|
Abbass, H.A., Bacardit, J., Butz, M.V. & Llora, X., 2004. Online Adaptation in Learning Classifier Systems: Stream Data Mining. Illinois Genetic Algorithms Laboratory: University of Illinois at Urbana-Champaign.
Abstract: In data mining, concept drift refers to the phenomenon that the underlying model (or con- cept) is changing over time. The aim of this paper is twofold. First, we propose a fundamental characterization and quanti¯cation of di®erent types of concept drift. The proposed theory enables a rigorous investigation of learning system performance on streamed data. In particu- lar, we investigate the impact of di®erent amounts and types of concept drift on evolutionary classi¯cation systems focusing on the learning classi¯er system approach. We compare perfor- mance of one Pittsburgh-type system, GAssist, which learns in batch mode using windowing techniques, with a Michigan-type system, XCS, which is a natural online learner. The results show that both systems are able to handle the various concept drifts well. Behavioral di®erences are discussed revealing task dependencies, representation dependencies as well as dynamics de- pendencies. Discussions and conclusions outline the path towards more detailed measures for problem dynamics in the data mining realm.
Keywords: GeneticProgramming
|
|
|
|
Allen, F. & Karjalainen, R., 1998. Using genetic algorithms to find technical trading rules, Journal of Financial Economics,(51), p. 245–271.
Abstract: We use a genetic algorithm to learn technical trading rules for the S&P 500 index using daily prices from 1928 to 1995. After transaction costs, the rules do not earn consistent excess returns over a simple buy-and-hold strategy in the out-of-sample test periods. The rules are able to identify periods to be in the index when daily returns are positive and volatility is low and out when the reverse is true. These latter results can largely be explained by low-order serial correlation in stock index returns.
Keywords: GeneticProgramming; TechnicalAnalysis
|
|
|
|
Bacardit, J., Burke, E.K. & Krasnoger, N., 2009. Improving the scalability of rule-based evolutionary learning, Memetic Computation, 1, p. 55–67.
Abstract: Evolutionary learning techniques are comparable in accuracy with other learning methods such as Bayesian Learning, SVM, etc. These techniques often produce more interpretable knowledge than, e.g. SVM; however, efficiency is a significant drawback. This paper presents a newrepresentation motivated by our observations that Bioinformatics and Systems Biology often give rise to very large-scale datasets that are noisy, ambiguous and usually described by a large number of attributes. The crucial observation is that, in the most successful rules obtained for such datasets, only a few key attributes (from the large number of available ones) are expressed in a rule, hence automatically discovering these few key attributes and only keeping track of them contributes to a substantial speed up by avoiding useless match operations with irrelevant attributes. Thus, in effective terms this procedure is performing a fine-grained feature selection at a rule-wise level, as the key attributes may be different for each learned rule. The representation we propose has been tested within the BioHEL machine learning system, and the experiments performed show that not only the representation has competent learning performance, but that it also manages to reduce considerably the system run-time. That is, the proposed representation is up to 2–3 times faster than state-of-the-art evolutionary learning representations designed specifically for efficiency purposes.
Keywords: GeneticProgramming; LargeScaleLearning
|
|
|
|
Becker, Y.L., Fei, P. & Lester, A.M.. Stock Selection – An Innovative Application of Genetic programming Methodology.
Abstract: One of the major challenges in an information-rich financial market is how effectively to derive an optimum investment solution among vast amounts of available information. The most efficacious combination of factors or information signals can be found by evaluating millions of possibilities, which is a task well beyond the scope of manual efforts. Given the limitations of the manual approach, factor combinations are typically linear. However, the linear combination of factors might be too simple to reflect market complexities and thus fully capture the predictive power of the factors. A genetic programming process can easily explore both linear and non-linear formulae. In addition, the ease of evaluation facilitates the consideration of broader factor candidates for a stock selection model. Based upon State Street Global Advisors (SSgA)’s previous research on using genetic programming techniques to develop quantitative investment strategies, we extend our application to develop stock selection models in a large investable stock universe, the S&P 500 index. Two different fitness functions are designed to derive GP models that accommodate different investment objectives. First, we demonstrate that the GP process can generate a stock selection model for a low active risk investment style. Compared to a traditional model, the GP model has significantly enhanced future stock return ranking capability. Second, to suit an active investment style, we also use the GP process to generate a model that identifies the stocks with future returns lying in the fat tails of the return distribution. A portfolio constructed based on this model aims to aggressively generate the highest returns possible compared to an index following portfolio. Our tests show that the stock selection power of the GP models is statistically significant. Historical simulation results indicate that portfolios based on GP models outperform the benchmark and the portfolio based on the traditional model. Further, we demonstrate that GP models are more robust in accommodating various market regimes and have more consistent performance than the traditional model.
Keywords: GeneticProgramming
|
|
|
|
Brabazon, A. & O'Neill, M., 2006. Credit Classification Using Grammatical Evolution, Informatica, 30, p. 325–335.
Keywords: GeneticProgramming
|
|
|
|
Brown, M. & Darley, V.. The Future of Trading: Biology-Based Market Modeling at NASDAQ,.
Keywords: GeneticProgramming
|
|
|
|
Butz, M.V., 2004. Rule-based Evolutionary Online Learning Systems: Learning Bounds, Classification, and Prediction. Ph.D. thesis. University of Illinois at Urbana-Champaign.
Abstract: Rule-based evolutionary online learning systems, often referred to as Michigan-style learning classier systems (LCSs), were proposed nearly thirty years ago (Holland, 1976; Holland, 1977) originally calling them cognitive systems. LCSs combine the strength of reinforcement learning with the generalization capabilities of genetic algorithms promising a exible, online generalizing, solely reinforcement dependent learning system. However, despite several initial successful applications of LCSs and their interesting relations with animal learning and cognition, understanding of the systems remained somewhat obscured. Questions concerning learning complexity or convergence remained unanswered. Performance in dierent problem types, problem structures, concept spaces, and hypothesis spaces stayed nearly unpredictable. This thesis has the following three major objectives: (1) to establish a facetwise theory approach for LCSs that promotes system analysis, understanding, and design; (2) to analyze, evaluate, and enhance the XCS classier system (Wilson, 1995) by the means of the facetwise approach establishing a fundamental XCS learning theory; (3) to identify both the major advantages of an LCS-based learning approach as well as the most promising potential application areas. Achieving these three objectives leads to a rigorous understanding of LCS functioning that enables the successful application of LCSs to diverse problem types and problem domains. The quantitative analysis of XCS shows that the interactive, evolutionary-based online learning mechanism works machine learning competitively yielding a low-order polynomial learning complexity. Moreover, the facetwise analysis approach facilitates the successful design of more advanced LCSs including Holland's originally envisioned cognitive systems.
Keywords: GeneticProgramming
|
|
|
|
Dempster, M.A.H. & Jones, C.M., 2000. A real-time adaptive trading system using genetic programming, Quantitative Finance, 1, p. 397–413.
Abstract: Technical analysis indicators are widely used by traders in financial and commodity markets to predict future price levels and enhance trading profitability. We have previously shown a number of popular indicator-based trading rules to be loss-making when applied individually in a systematic manner. However, technical traders typically use combinations of a broad range of technical indicators. Moreover, successful traders tend to adapt to market conditions by ‘dropping’ trading rules as soon as they become loss-making or when more profitable rules are found. In this paper we try to emulate such traders by developing a trading system consisting of rules based on combinations of different indicators at different frequencies and lags. An initial portfolio of such rules is selected by a genetic algorithm applied to a number of indicators calculated on a set of US Dollar/British Pound spot foreign exchange tick data from 1994 to 1997 aggregated to various intraday frequencies. The genetic algorithm is subsequently used at regular intervals on out-of-sample data to provide new rules and a feedback system is utilized to rebalance the rule portfolio, thus creating two levels of adaptivity. Despite the individual indicators being generally loss-making over the data period, the best rule found by the developed system is found to be modestly, but significantly, profitable in the presence of realistic transaction costs.
Keywords: GeneticProgramming; TechnicalAnalysis
|
|