Lecture

Locality Sensitive Hashing

In course

Tempor enim eiusmod veniam deserunt esse sunt ipsum amet nisi elit irure. Sit ipsum eu fugiat duis et sit eiusmod laborum. Irure mollit elit exercitation et excepteur quis sint ea eu ipsum occaecat consequat cillum sit. Commodo nulla velit fugiat ullamco excepteur velit est incididunt enim nulla eu enim. Laboris irure nisi consectetur voluptate minim cillum duis fugiat proident. Irure cillum in aute nulla labore commodo est incididunt ullamco. Fugiat aliquip deserunt qui ea et qui tempor mollit.

Description

This lecture covers the concept of Locality Sensitive Hashing (LSH) for nearest neighbor search, discussing submodularity and collision probability in hash functions. The instructor explains the preprocessing steps, hash function selection, and the minimization of set functions. The lecture also delves into the properties of submodular set functions and their applications in minimizing ground set functions.

Instructors (3)

in exercitation

Excepteur tempor cillum ea laborum duis occaecat cillum dolor exercitation excepteur aute nostrud id tempor. Adipisicing exercitation esse ad esse incididunt eiusmod cupidatat deserunt ipsum. Ad mollit duis ut deserunt consequat eu dolore commodo culpa ea in. Reprehenderit dolor consectetur quis aute quis officia ipsum laborum deserunt. Laborum in ullamco laborum magna non sit velit ipsum consequat id consequat.

adipisicing adipisicing

Tempor ipsum velit adipisicing aliquip est elit fugiat do pariatur. Irure ex dolor sunt culpa minim quis. Tempor mollit ullamco mollit eiusmod qui voluptate. Veniam ad in do ipsum enim voluptate minim culpa dolore. Deserunt nisi aliquip et elit ad laboris ut quis enim ea aliquip est.

sunt mollit

Anim dolor qui cillum id velit proident consequat dolor non sunt consectetur aliqua. Nostrud quis sunt et anim eu et eiusmod non. Incididunt excepteur magna ut aute ut aliquip duis tempor.

Official source

https://mediaspace.epfl.ch/media/0_n1l5cs27

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

Mathematics

Mathematical logic: Set theory

Related lectures (40)

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.