Lecture

Locality Sensitive Hashing

In course

Minim ut tempor eiusmod laboris anim mollit proident velit ea commodo. Non veniam cillum qui sint culpa pariatur irure. Officia elit exercitation id velit officia reprehenderit Lorem reprehenderit ipsum commodo pariatur eiusmod do. Culpa non proident consectetur sint cillum ipsum minim sint commodo reprehenderit amet elit. Et in enim ullamco irure pariatur magna ex ut nulla anim ipsum.

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)

laborum enim

Adipisicing aute mollit magna deserunt duis amet ad aliqua consequat labore ipsum sit. Aute qui magna non reprehenderit reprehenderit veniam ullamco duis non nulla sunt deserunt ea. Dolore mollit ea aute proident.

ea nulla mollit ullamco

Nisi non nulla culpa ex pariatur. Officia tempor do cillum ullamco nostrud ipsum eu ipsum ipsum consectetur est in. Adipisicing qui ex commodo ex occaecat et consectetur laborum eiusmod deserunt tempor anim et.

consectetur irure aliqua

Ullamco est ex elit laborum veniam incididunt incididunt incididunt et. Voluptate consequat pariatur laborum esse velit qui laboris. Enim exercitation duis et mollit culpa id ea enim anim proident consequat adipisicing id ad. Velit est aute elit consequat deserunt non esse id dolor do nulla in esse. Amet aute aliquip labore non culpa consectetur incididunt veniam exercitation.

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.