Decision Tree Algorithms  ID3 (Iterative Dichotomiser 3)  Gets stuck on local optimums, Greedy  Not good on attributes with continuous values  C4.5/J4.8  Extension of ID3  Better handling of attributes with continuous values  Can handle training data where some attribute values are missing/unknown  Handling attributes with different costs  Pruning Tree after creation  C5.0/See5.0  Commercial, closed-source  Not talking about this, but it exists Evolutionary Computing Systems Lab (ECSL), University of Nevada, Reno 17
{}