Lecture

Dimensionality Reduction: Curse of Dimensionality

Description

This lecture covers the curse of dimensionality, which implies that in high dimensions, data points become increasingly isolated, requiring more training data. Methods for variable selection, such as filtering based on correlation or mutual information, are discussed. The coefficient of determination is introduced as a measure of how well predicted values correlate with actual values. Limitations of filtering methods are highlighted, using the example of explaining the output of an exclusive OR (XOR) operation. Overall, the lecture emphasizes the challenges and strategies for reducing dimensionality in machine learning.

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
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.