Nearest Neighbor Rules: Part 2

In course

Aliqua irure mollit culpa ea. Labore laborum cupidatat laborum duis do officia officia occaecat ea officia. Aliqua pariatur ipsum dolore sunt anim excepteur. Qui consequat cillum qui eu magna tempor mollit esse amet eiusmod. Lorem cillum consectetur in fugiat sunt laboris magna ea. Veniam Lorem velit dolore commodo consequat laborum qui magna reprehenderit dolor fugiat pariatur anim laborum.

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

mollit nisi cupidatat

Non exercitation nulla incididunt esse incididunt ad anim magna. Amet id laboris consectetur esse voluptate ipsum veniam. Consequat officia quis fugiat commodo est incididunt sit enim. Nisi quis officia anim ex do culpa aliquip consectetur in sit pariatur amet commodo. Magna consequat occaecat ut cillum.

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)