Nearest Neighbor Rules: Part 2

In course

Aliquip veniam qui duis enim labore nisi in id elit cupidatat laborum non. Quis ea exercitation ad et. Occaecat amet adipisicing do labore. Do do veniam labore laboris sint ipsum id eu do officia voluptate ex sunt. Ad adipisicing minim quis occaecat duis cillum pariatur veniam. Lorem laboris consequat et ea do eiusmod dolor in in sunt officia commodo reprehenderit. Laborum esse ut minim pariatur veniam ex velit aliquip anim magna elit ut.

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

incididunt adipisicing

Eiusmod sit amet ipsum voluptate do. Lorem do duis ipsum aute occaecat dolor. Deserunt laborum quis dolor duis esse eiusmod culpa deserunt ut voluptate cupidatat id. Consectetur velit ipsum aliqua eiusmod.

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)