The use of Meta-Heuristics in Data Mining

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

@Misc{Smith:2004:talk,
  author =       "George D. Smith",
  title =        "The use of Meta-Heuristics in Data Mining",
  howpublished = "Meeting of the Operations Research society",
  year =         "2004",
  month =        "5th " # mar,
  keywords =     "genetic algorithms, genetic programming",
  URL =          "http://www.orsoc.org.uk/region/study/local/DM_handouts.pdf",
  size =         "29 slide",
  abstract =     "Meta-Heuristics form a family of search algorithms
                 used in tackling large, complex combinatorial
                 optimisation problems. The family includes simulated
                 annealing, tabu search, guided local search, GRASP,
                 evolutionary algorithms and ant colony optimisation. At
                 UEA, we have a team of researchers developing and
                 applying meta-heuristics to applications in data
                 mining. Two case studies will be presented: the first
                 is an application of simulated annealing to induce
                 covering rules in a classification problem, the second
                 is the application of genetic programming to construct
                 (evolve) new and highly predictive features from the
                 given predicting attribute set.",
  notes =        "School of Computer Science, University of East Anglia,
                 UK",
}

Genetic Programming entries for George D Smith

Citations