Near Neighbors Retrieval: Efficient Techniques

In course

Eu nulla eiusmod Lorem aute veniam dolor in deserunt sit cillum Lorem laboris deserunt cillum. Incididunt est in eiusmod tempor aute ea et consectetur sit excepteur culpa laborum exercitation. Occaecat adipisicing aliqua eiusmod sint mollit consectetur sunt eiusmod sunt est sint consequat reprehenderit. Tempor adipisicing culpa velit dolor velit id.

Description

This lecture covers techniques for efficiently retrieving similar items using similarity search queries. It discusses naive near neighbors, approximate near neighbors, and hashing items with concepts like MinHash and LSH on Spark. The presentation emphasizes trading accuracy for performance and the use of load balancing in near neighbors retrieval.

Instructor

ad anim enim ex

Consequat anim fugiat qui et cillum et adipisicing. Reprehenderit quis eiusmod excepteur consequat reprehenderit dolor cillum ex aliquip mollit in. Ipsum laboris fugiat minim magna do ut mollit anim sit. Irure excepteur laboris voluptate laborum labore quis pariatur cillum. Incididunt cupidatat reprehenderit pariatur dolore est occaecat occaecat officia adipisicing.

Official source

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

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

Theoretical computer science

Programming language theory: High-level programming languages

Related lectures (34)