Java implementation of Decision Trees (ID3 Algorithm) refer http://www2.cs.uregina.ca/~hamilton/courses/831/notes/ml/dtrees/4_dtrees2.html for algorithmic details.
To run the project run the file MonksProblem.java with arguments "TrainingFileName TestFileName"
Running the file MonksProblem.java should all the labels for test data as well as the Precision/Recall numbers. Assume label 1 to be true and 0 to be false and have printed the output in this way.