Lecture

Perceptron: Part 2

Description

This lecture covers the Perceptron algorithm, one of the earliest iterative solutions for binary classification problems. It discusses linear separability, convergence properties, and limitations of the algorithm. The lecture also introduces the Pocket Perceptron algorithm, which improves the behavior of Perceptron for non-linearly separable data by keeping track of the best weight iterate. Examples using heart disease data demonstrate the application of Perceptron and Pocket Perceptron, showcasing empirical error rates for both reduced and full-dimensional feature vectors.

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.