Decision Tree Classification with 0 on BOTH terminal nodes of branches?
조회 수: 2 (최근 30일)
이전 댓글 표시
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!
댓글 수: 0
채택된 답변
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.
추가 답변 (0개)
참고 항목
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!