Lecture

Nearest Neighbor Search: Johnson-Lindenstrauss Lemma

Description

This lecture covers the Nearest Neighbor search algorithm, focusing on the Johnson-Lindenstrauss lemma for dimensionality reduction. The instructor explains the concept of Nearest Neighbor search and the importance of the Johnson-Lindenstrauss lemma in reducing dimensionality. The lecture discusses the process of preprocessing data to improve search efficiency and the use of locality-sensitive hashing for approximate nearest neighbor search. Various techniques, such as hash families and sensitive hashing, are explored to optimize the search process.

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.

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.