Genetic-program-based data mining for hybrid decision-theoretic algorithms and theories

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@InProceedings{smith:2005:SPIE,

• author = "James F. {Smith, III}",
• title = "Genetic-program-based data mining for hybrid decision-theoretic algorithms and theories",
• booktitle = "Intelligent Computing: Theory and Applications III",
• year = "2005",
• editor = "Kevin L. Priddy",
• volume = "5803",
• pages = "86--97",
• month = "28 " # mar,
• publisher = "SPIE",
• keywords = "genetic algorithms, genetic programming",
• DOI = "doi:10.1117/12.603151",
• abstract = "A genetic program (GP) based data mining (DM) procedure has been developed that automatically creates decision theoretic algorithms. A GP is an algorithm that uses the theory of evolution to automatically evolve other computer programs or mathematical expressions. The output of the GP is a computer program or mathematical expression that is optimal in the sense that it maximizes a fitness function. The decision theoretic algorithms created by the DM algorithm are typically designed for making real-time decisions about the behavior of systems. The database that is mined by the DM typically consists of many scenarios characterized by sensor output and labeled by experts as to the status of the scenario. The DM procedure will call a GP as a data mining function. The GP incorporates the database and expert's rules into its fitness function to evolve an optimal decision theoretic algorithm. A decision theoretic algorithm created through this process will be discussed as well as validation efforts showing the utility of the decision theoretic algorithm created by the DM process. GP based data mining to determine equations related to scientific theories and automatic simplification methods based on computer algebra will also be discussed.",

}

Genetic Programming entries for James F Smith III

Citations