YaDT: Yet another Decision Tree builder

YaDT is a new implementation of the C4.5 decision tree induction algorithm designed and implemented in standard C++ from scratch

YaDT: Yet another Decision Tree builder
Version 1.2.5 (October 2010)
www.di.unipi.it/~ruggieri/software

YaDT is a new implementation of the C4.5 decision tree induction algorithm designed and implemented in standard C++ from scratch. Benefits of YaDT include:

a structured object-oriented programming implementation,
portable code over Windows (Visual Studio) and Linux (gcc)
32 bit and 64 bit executables,
a documented C++ library of classes,
PMML compliant XML output of trees,
compressed binary ouput/input of trees,
case weightings, hould-out, simplified error-based pruning,
a command line tree builder and a Java GUI.

YaDT is the fastest main memory implementation of C4.5, recently further enhanced with parallelism over multi-core machines (only for Linux) by exploiting the Fastflow library.

Reference papers:

S. Ruggieri YaDT: Yet another Decision Tree builder., 16th International Conference on Tools with Artificial Intelligence (ICTAI 2004): 260-265. IEEE Press, November 2004.
M. Aldinucci, S. Ruggieri, M. Torquati., Porting Decision Tree Algorithms to Multicore using FastFlow. 21th European Conference on Machine Learning and 14th Principles and Practice of Knowledge Discovery in Databases, (ECML-PKDD 2010), Part I: 7-23., Vol. 6321 of LNCS, Springer, September 2010.