13.3.2 Decision Trees & Random Forest Feature Importance (L13: Feature Selection) @SebastianRaschka
13.3.2 Decision Trees & Random Forest Feature Importance (L13: Feature Selection)  @SebastianRaschka
Uploaded December 2021 | Updated September 2026, 2 weeks ago
Sebastian's books: sebastianraschka.com/books

This video explains how decision trees training can be regarded as an embedded method for feature selection. Then, we will also look at random forest feature importance and go over two different ways it's computed: (a) impurity-based and (b) permutation-based.

Slide link: sebastianraschka.com/pdf/lecture-notes/stat451fs21/13_feat-sele__slides.pdf

Code link: github.com/rasbt/stat451-machine-learning-fs21/blob/main/13-feature-selection/03_random-forest.ipynb

-------

This video is part of my Introduction of Machine Learning course.

Next video: youtu.be/SljoN0cO95Q

The complete playlist: youtube.com/playlist?list=PLTKMiZHVd_2KyGirGEvKlniaWeLOHhUF3

A handy overview page with links to the materials: sebastianraschka.com/blog/2021/ml-course.html

-------

If you want to be notified about future videos, please consider subscribing to my channel: youtube.com/c/SebastianRaschka
13.3.2 Decision Trees & Random Forest Feature Importance (L13: Feature Selection)L13.9.1 LeNet-5 in PyTorchL17.4 Variational Autoencoder Loss FunctionL9.3.1 Multilayer Perceptron   Code Example Part 1/3 (Slide Overview)L4.2 Tensors in PyTorch
Sebastian Raschka |

13.3.2 Decision Trees & Random Forest Feature Importance (L13: Feature Selection)

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER