The MML evolution of classification graphs

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

  author =       "Julian Neil and Kevin B. Korb",
  title =        "The MML evolution of classification graphs",
  institution =  "Department of Computer Science, Monash University",
  year =         "1996",
  type =         "Technical report",
  number =       "CS 96/252",
  address =      "Melbourne, Australia",
  month =        "15 " # jan,
  keywords =     "genetic algorithms, genetic programming,
                 classification graphs (DAGs), decision graph,
                 classification graph, DGraph, minimum message length,
                 MML, description, MDL, C4.5",
  URL =          "",
  abstract =     "NB. what is commonly called a decision [tree$|$graph]
                 is more correctly called a classification tree or graph
                 (as here)",
  notes =        "not a classic tree lisp S-expression but variable size
                 graph chromosomes are evolved by a GA. Tested on usual
                 machine learning test set. See also
                 \cite{Neil:1999:ECM} (and a number of technical reports
  size =         "20 pages",

Genetic Programming entries for Julian R Neil Kevin B Korb