A simple decision tree. Each internal node is assigned an axis aligned
boundary which divides the space in 2 (left and right). To determine the
value of an input point, we simple determine which side of the boundary line
the input lies on, then recurse on that side. When we reach a leaf node, we
output its value.
A simple decision tree. Each internal node is assigned an axis aligned boundary which divides the space in 2 (left and right). To determine the value of an input point, we simple determine which side of the boundary line the input lies on, then recurse on that side. When we reach a leaf node, we output its value.