Why Adtree has more accuracy than C4.5 [closed]

Question

Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.

---

Closed 8 years ago.

• This question appears to be off-topic because it lacks sufficient information to diagnose the problem. Describe your problem in more detail or include a minimal example in the question itself.
• Questions asking for code must demonstrate a minimal understanding of the problem being solved. Include attempted solutions, why they didn't work, and the expected results. See also: Stack Overflow question checklist

Improve this question

I've been working on a data mining project lately, and it confuses me a lot that alternating decision tree seems to have more accuracy than WEKA built-in j48 algorithm. I don't have much idea about how these two algorithms are implemented, I hope someone can explain this from the algorithm point of view. Thanks a lot.

Answer 1

I don't have much idea about how these two algorithms are implemented

No one can explain to you why one can perform better than the other if you don't even understand the starting points. Learn about C4.5 and then learn about ADTrees.

Otherwise this would be an exercise in trying to teach you two algorithms in a single giant post - which is futile.