Decision Tree Classification with 0 on BOTH terminal nodes of branches?

2 vues (au cours des 30 derniers jours)
Justin
Justin le 2 Oct 2014
Commenté : Justin le 6 Oct 2014
Using t=fitctree(x,y,'MinLeaf',20) and then view(t,'Mode','Graph') to look at how the tree is working, and I see that in several cases the result at a terminal branch is for BOTH end points to be '0', or BOTH to be '1'.
How can this be? I would expect each branch to end with one '0' and one '1', never two '0' or two '1'.
Thanks!

Connectez-vous pour répondre à cette question.

Réponse acceptée

Ilya
Ilya le 6 Oct 2014
Nothing wrong with that. A classification tree optimizes the Gini index and can split a parent node in two child nodes dominated by the same class.
  1 commentaire
Justin
Justin le 6 Oct 2014
OK so I'm thinking that the two leaf nodes can both be for say, 0 but be grouped as different levels of 'closeness' to 0 as compared to 1...Thanks00

Connectez-vous pour commenter.

Plus de réponses (0)

Catégories

En savoir plus sur Classification Trees dans Help Center et File Exchange

Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by