Hi All, I was wondering if anyone could tell me just how similar the JMP decision tree (partition) algorithm is to the classic CHAID approach.
Go to Solution
Here is a very brief overview on differences (from the SAS forum, but the same insights apply):
What differentiates the various Tree algorithms? What are the main differences between CHAID and CAR...
and a more involved description I like from Prof. Galit Shmueli:
Classification Trees: CART vs. CHAID
I hope this helps!
View solution in original post