In
this article, I described a method how we can code CART algorithm in
python language. I think it is a good exercise to build your own
algorithm to increase your coding skills and tree knowledge. It's not
the fastest algorithm implementation but it's enough to understand
CART and object oriented programming.
Cart
algorithm
In
1983, Breiman et al first described CART algorithm like classified
and Regression Tree. It could be used for regression and
classification of binary target.
It's
a recursive algorithm, at each iteration it finds the best splitting
of data which could increase the probability of predicting the target
values.
Tree
definition
A
tree is composed of nodes. Each node could have one, two children or
could be a leaf node, a node with no children.
In
a list, I stored each object Node.
Tree=[node1,
node2, node3, node4….]