# Can I represent a non-boolean function with a TREE?

I have a question in respect to tree representation of a non-Boolean function. Is there any problem in representing a function from space

Boolean->Limited Integer or
Limited Integer->Limited integer by a (decision) tree?

I don’t see any problem, but don’t find any remark about that on the net.

-

Similarly, the internal nodes can be pretty flexible. Traditionally, they're binary decisions, but they can be binary decisions on integers or real values (e.g., if $X>22.8$, do one thing, otherwise, do another). There are some extensions that do multiple splits at each node--I think one is called CHAID. You may also want to check out a related technique called MARS, which reportedly works well for all-numeric data. I haven't played with it much, but there are open source packages for python, matlab, and R.