%0 Report %1 Neil96 %A Neil, Julian %A Korb, Kevin B. %C Melbourne, Australia %D 1996 %K (DAGs), C4.5 DGraph, MDL, MML, algorithms, classification decision description, genetic graph, graphs length, message minimum programming, %N CS 96/252 %T The MML evolution of classification graphs %U http://www.csse.monash.edu.au/publications/1996/tr-cs96-252.ps.gz %X NB. what is commonly called a decision tree$|$graph is more correctly called a classification tree or graph (as here)

@techreport{Neil96, abstract = {NB. what is commonly called a decision [tree$|$graph] is more correctly called a classification tree or graph (as here)}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Melbourne, Australia}, author = {Neil, Julian and Korb, Kevin B.}, biburl = {https://www.bibsonomy.org/bibtex/212f96ad4e0f72900375294d915a41f84/brazovayeye}, institution = {Department of Computer Science, Monash University}, interhash = {325805ee2a07ec35cde067027cf0076b}, intrahash = {12f96ad4e0f72900375294d915a41f84}, keywords = {(DAGs), C4.5 DGraph, MDL, MML, algorithms, classification decision description, genetic graph, graphs length, message minimum programming,}, month = {15 January}, 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 1998-99)}, number = {CS 96/252}, size = {20 pages}, timestamp = {2008-06-19T17:48:11.000+0200}, title = {The {MML} evolution of classification graphs}, type = {Technical report}, url = {http://www.csse.monash.edu.au/publications/1996/tr-cs96-252.ps.gz}, year = 1996 }