Lecture

Feature Expansion and Kernels

Description

This lecture covers the concepts of feature expansion and kernels in machine learning. It starts with a recap of linear models, margin, and maximum margin classifier. Then, it delves into support vector machines (SVM) formulation, overlapping classes, and slack variables. The lecture explains the differences between least-square classification, logistic regression, and SVM. It introduces the concept of polynomial feature expansion and its application in nonlinear classification. The lecture also discusses the curse of dimensionality, nearest neighbor methods, and k-nearest neighbors for classification and regression. It concludes with kernel functions, kernel trick, kernel regression, and kernel SVM for classification.

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.