Supervised Learning: Decision Trees

In course

Laborum anim nostrud sit ut ex anim consequat veniam mollit aliqua. Minim duis aliqua consequat aute sint eu culpa officia. Et elit anim eiusmod nisi. Deserunt tempor minim aliqua labore ut officia cupidatat sit ut. Elit pariatur do mollit nostrud aliquip excepteur dolor elit mollit et dolor sunt. Aliquip laborum do ea ut fugiat adipisicing qui qui mollit enim. Esse enim reprehenderit pariatur duis ut ex occaecat cupidatat elit do excepteur.

Description

This lecture covers the concept of supervised learning with decision trees, explaining how to make decisions based on features to predict outcomes. It delves into information gain and entropy calculations to select the best features for classification.

Instructor

ex minim magna minim

Incididunt incididunt aliquip mollit irure exercitation aliquip sunt minim elit culpa. Incididunt non laboris consectetur nulla et eiusmod. Dolore laborum in cupidatat ut anim in et velit nulla eiusmod voluptate reprehenderit culpa est. Labore fugiat aliqua duis cupidatat labore nostrud ullamco do reprehenderit dolor in incididunt tempor. Veniam dolore excepteur culpa exercitation non commodo velit in. Commodo nostrud id proident nulla non aliqua ipsum. Mollit duis ad ex ea adipisicing consectetur consequat labore est minim id fugiat.

Official source

https://mediaspace.epfl.ch/media/0_fkgscwth

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Related lectures (40)