Implement the decision tree learning algorithm using Information gain heuristic and Variance impurity heuristic
Instructions to execute:
- make (This will compile the program)
- java ProgramDT training-set validation-set test-set to-print (This will generate both the inorder and out-of-order output_file)
- make clean (Optional : This will clean compiled .class files)
Output of the program:
- if is 'yes' then Program will print Trees using both Heuristic and respective accuracies
- if is 'no' then Program will print accuracies of DT for both Heuristics