Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Decision Trees: Classification

In course

ENG-209: Data science for engineers with Python

Ce cours propose une immersion progressive et complète dans le domaine de la Data Science à travers le langage Python. Il guide les étudiants depuis la manipulation de données brutes jusqu'à la modélisation et l'extraction de connaissances utiles à partir ...

Description

This lecture covers decision trees for classification, supervised learning, measuring the quality of a split using entropy, and the concept of information gain. It also includes a demonstration in Tableau & KNIME, one-hot encoding, hyperparameter optimization, and the use of random forests. The instructor explains the process of optimizing hyperparameters, one-hot encoding with scikit-learn and pandas, and the importance of choosing the right model. The lecture concludes with an overview of cross-validation, model evaluation, and the sklearn.tree.DecisionTreeClassifier parameters.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

Olivier Verscheure

Jean-Philippe Pellet

Official source

Ontological neighbourhood

Information engineering

Machine learning: Decision tree learning

Information theory: Channel capacity

Related concepts (32)

Decision tree

A decision tree is a decision support hierarchical model that uses a tree-like model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. It is one way to display an algorithm that only contains conditional control statements. Decision trees are commonly used in operations research, specifically in decision analysis, to help identify a strategy most likely to reach a goal, but are also a popular tool in machine learning.

Decision tree learning

Decision tree learning is a supervised learning approach used in statistics, data mining and machine learning. In this formalism, a classification or regression decision tree is used as a predictive model to draw conclusions about a set of observations. Tree models where the target variable can take a discrete set of values are called classification trees; in these tree structures, leaves represent class labels and branches represent conjunctions of features that lead to those class labels.

Random forest

Random forests or random decision forests is an ensemble learning method for classification, regression and other tasks that operates by constructing a multitude of decision trees at training time. For classification tasks, the output of the random forest is the class selected by most trees. For regression tasks, the mean or average prediction of the individual trees is returned. Random decision forests correct for decision trees' habit of overfitting to their training set.

Cross-validation (statistics)

Cross-validation, sometimes called rotation estimation or out-of-sample testing, is any of various similar model validation techniques for assessing how the results of a statistical analysis will generalize to an independent data set. Cross-validation is a resampling method that uses different portions of the data to test and train a model on different iterations. It is mainly used in settings where the goal is prediction, and one wants to estimate how accurately a predictive model will perform in practice.

Information gain (decision tree)

In information theory and machine learning, information gain is a synonym for Kullback–Leibler divergence; the amount of information gained about a random variable or signal from observing another random variable. However, in the context of decision trees, the term is sometimes used synonymously with mutual information, which is the conditional expected value of the Kullback–Leibler divergence of the univariate probability distribution of one variable from the conditional distribution of this variable given the other one.

Related lectures (56)

Building a Decision Tree

Covers building decision trees to classify mushrooms as poisonous or not.

Decision Trees: Induction & Attributes

Explores decision trees, attribute selection, bias-variance tradeoff, and ensemble methods in machine learning.

Supervised Learning: Decision Trees

Covers supervised learning with decision trees and feature selection for classification.

Model Assessment and Hyperparameter Tuning

Explores model assessment, hyperparameter tuning, and resampling strategies in machine learning.

Decision Forests: Structure and Training