Lecture

Classification: Decision Trees and kNN

Description

This lecture covers the fundamentals of classification, focusing on decision trees and k-nearest neighbors (kNN). Decision trees are explained as a series of tests to assign classes, while kNN classifies based on similarity to training instances. The lecture includes examples, such as predicting student performance and passing exams. It also delves into metrics like accuracy, AUC, and confusion matrices, essential for evaluating classification models.

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.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.