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

2 次查看（过去 30 天）
Justin
Justin 2014-10-2
评论： Justin 2014-10-6
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!

请先登录，再回答此问题。

采纳的回答

Ilya
Ilya 2014-10-6
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 个评论
Justin
Justin 2014-10-6
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

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Classification Trees 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by