單一決策樹 $$分割M-1次,得到M個節點R_m,反應變數可為有K個水準的分類變數或連續變數$$節點不純度(Impurity) Classification error rate $$\begin{aligned} E_m &= \frac{\text{# misclassified}}{\text{# samples in } R_m} \\ &= 1 - \max_k(\hat{p_{mk}}) \\ \text{(因為最大機率對應的 } &k \text{ 就是 } \hat{Y}_m\t...
Markdown supported · ⌘↵ to post
No responses yet.