Decision Tree 1: how it works

Описание к видео Decision Tree 1: how it works

Full lecture: http://bit.ly/D-Tree
A Decision Tree recursively splits training data into subsets based on the value of a single attribute. Each split corresponds to a node in the. Splitting stops when every subset is pure (all elements belong to a single class) -- this can always be achieved, unless there are duplicate training examples with different classes.

Комментарии

Информация по комментариям в разработке