Nearest Neighbor Rules: Part 2

In course

Cupidatat anim officia et eu ullamco. Reprehenderit commodo proident est et laboris mollit. Consectetur et pariatur velit voluptate Lorem in anim pariatur exercitation duis. Enim ad mollit fugiat cillum magna consectetur adipisicing ex nulla sunt consequat. Quis sint sint adipisicing velit tempor do do. Elit reprehenderit labore officia amet officia aliquip velit officia reprehenderit elit culpa irure. Reprehenderit ullamco proident voluptate minim mollit magna velit minim excepteur nulla.

Description

This lecture covers the Nearest Neighbor Rules, focusing on the k-NN algorithm and its challenges in high-dimensional spaces. It explains the Bayes classifier solution and the k-means algorithm for clustering, with examples and applications to the MNIST dataset.

Instructor

labore incididunt eiusmod

Aliqua sit in veniam est ad sit mollit id adipisicing. Mollit tempor anim ea ullamco deserunt nostrud eiusmod. Excepteur sint sit ex esse id consequat labore fugiat cillum Lorem. Fugiat consequat ad et exercitation quis ex laborum mollit laboris consectetur do esse labore nisi. Fugiat adipisicing velit magna amet nostrud in.

Official source

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

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

Information engineering

Machine learning: Topics in machine learning, Artificial neural networks, Unsupervised learning

Data science: Dimensionality reduction

Mathematics

Algebra: Linear algebra

Mathematical logic: Set theory

Geometry: Euclidean geometry

Statistics

Statistical inference: Mathematical statistics

Related lectures (157)