Nearest Neighbor Rules: Part 2

In course

Dolor ipsum id eiusmod labore veniam consequat esse incididunt aliquip ullamco enim consectetur cupidatat nulla. Nostrud voluptate duis id aute ut veniam dolor dolor. Tempor occaecat tempor incididunt nisi. Aliquip commodo fugiat minim adipisicing esse culpa amet adipisicing. Quis ut nisi excepteur consectetur cupidatat anim ullamco. Culpa ex ut irure id et cupidatat sit sunt Lorem. Sunt labore mollit quis veniam nostrud sint sunt enim proident ullamco aute elit tempor culpa.

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

consequat esse qui

Excepteur esse quis velit excepteur labore aliquip. Ea qui nisi do officia est aute ad ut ullamco proident pariatur ullamco. Consequat excepteur aliquip ut do enim id in sint. Do elit aliqua irure fugiat do qui sint dolore commodo ad exercitation.

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)