Question

What would be a good choice of programming language in which to implement a decision tree? The results of the implementation will be for personal use only, so no need to consider ability to publish etc.

I have heard that Octave is a good option, can anyone explain why a matrix based language is recommended for implementing decision trees?

Answer 1

I have used Standard ML both to implement decision trees and to write a compiler from a domain-specific language into decision trees. I’ve also compiled similar decision trees into C code.

It really depends what you want to do with decision trees. If you are trying to do something sophisticated or you are trying to make the decision trees especially easy to read and write, I would suggest either creating a domain-specific language or embedding domain-specific operators into Haskell or Standard ML. If you just want to get going, you could start with ML (easier than Haskell for a beginner) and that preserves some options for later.

In general, ML and Haskell are both very good at representing and manipulating trees of all kinds.

I can’t explain why someone would recommend a matrix-based language for decision trees.