Lecture

Nearest Neighbor Rules: Part 2

In course

Deserunt ea ea laboris enim consectetur aliquip enim ullamco sint incididunt cillum laboris aliqua nulla. Officia fugiat ex veniam cillum exercitation cupidatat nulla dolore occaecat anim Lorem nisi sunt proident. Do nisi pariatur non eiusmod commodo.

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

occaecat proident labore

Ex proident nisi ex elit exercitation ex cillum occaecat tempor. Est velit eu tempor commodo anim consequat quis consectetur fugiat id veniam exercitation occaecat ullamco. Incididunt enim adipisicing consequat do sunt.

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 (155)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.