How to select the optimal split rule? (information gain/entropy) | COMP70885W: Introduction to Machine Learning | Department of Computing | Imperial College London

This is an archived version of the course. Please see the latest version of the course.

Module 2

K-Nearest Neighbours and Decision Trees

How to select the optimal split rule? (information gain/entropy)

In order to find the best split rule, we use the information gain, which is derived from the information entropy. This is covered in this video:

<< Previous Next >>