Welcome to the InfoSci Platform
Reference Hub3
Genetic Programming as a Data-Mining Tool

Genetic Programming as a Data-Mining Tool

Peter W.H. Smith
Copyright: © 2002 |Pages: 17
ISBN13: 9781930708259|ISBN10: 1930708254|EISBN13: 9781591400110
DOI: 10.4018/978-1-930708-25-9.ch008
Cite Chapter Cite Chapter

MLA

Smith, Peter W.H. "Genetic Programming as a Data-Mining Tool." Data Mining: A Heuristic Approach, edited by Hussein A. Abbass, et al., IGI Global, 2002, pp. 157-173. https://doi.org/10.4018/978-1-930708-25-9.ch008

APA

Smith, P. W. (2002). Genetic Programming as a Data-Mining Tool. In H. Abbass, R. Sarker, & C. Newton (Eds.), Data Mining: A Heuristic Approach (pp. 157-173). IGI Global. https://doi.org/10.4018/978-1-930708-25-9.ch008

Chicago

Smith, Peter W.H. "Genetic Programming as a Data-Mining Tool." In Data Mining: A Heuristic Approach, edited by Hussein A. Abbass, Ruhul Sarker, and Charles S. Newton, 157-173. Hershey, PA: IGI Global, 2002. https://doi.org/10.4018/978-1-930708-25-9.ch008

Export Reference

Mendeley
Favorite

Abstract

Genetic Programming (GP) has increasingly been used as a data-mining tool. For example, it has successfully been used for decision tree induction (Marmelstein and Lamont, 1998; Choenni, 1999), data fusion (Langdon, 2001) and has also been used for the closely related problem of intelligent text retrieval on the Internet (Bergstrom, Jaksetic and Nordin, 2000). Indeed its ability to induce a program from data makes it a very promising tool for data mining applications. It has been successfully applied in many different fields and has even produced results that have exceeded those produced by other means. For example it has been used to evolve chemical structures (Nachbar, 2000) using a quantitative structure activity relationship model. It has also had success in spacecraft attitude control (Howley, 1996) where near-minimum spacecraft attitude manoeuvres were evolved which outperformed previous hand-coded solutions. It has also been used in quantum computing, where it was used to evolve quantum algorithms (Barnum, Bernstein and Spector, 2000). In this work, it rediscovered known algorithms such as Deutsch’s Early Promise Problem and discovered quantum results that experts did not think could exist, for example, AND-OR query problem. These examples demonstrate the versatility and potential of GP.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.