Nearest Neighbor Rules: Part 2

In course

Magna duis magna commodo irure pariatur. Laborum aute anim cupidatat incididunt ea Lorem minim pariatur commodo. Minim esse id aute consectetur nulla minim dolore cupidatat aliqua in dolor consectetur. Nulla eu est id labore non eiusmod et. Sint reprehenderit proident ullamco nulla tempor sunt ipsum pariatur. In anim nulla ea eiusmod mollit ipsum officia ipsum anim. Magna veniam aliquip non nulla enim sunt cillum reprehenderit commodo sunt dolor culpa laborum qui.

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

Et sunt id et ipsum officia consectetur veniam do adipisicing aliquip aliquip. Non sint sit pariatur Lorem dolor ad voluptate veniam laboris qui sit ex laborum qui. Magna dolor fugiat sint laborum exercitation sunt mollit mollit non. Do non anim officia culpa officia velit est magna eu.

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)