Regularization review

Decision Tree

perceptrons(1969)

XOR problem

Examples of Decision tree

• Root node(최상위 노드를 말함) / Interval node(중간 노드) / Leaf node(최하위, terminal node라고도 함)

• Parent node / Child node

  

• Branch

• Depth

  

Methodology to make Decision Tree

• split the data recursively
• How? - split variable(when categorical) or value(when numerical)
• What is criteria

➡️ Increase Purity(순수도) = Decrease Impurity(불순도)

e.g, 0과 1이 섞여있는 것을 순수하게 섞이도록(100:0) split