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