Near Neighbors Retrieval: Efficient Techniques

In course

Anim veniam enim nisi ullamco ea. Duis culpa laboris adipisicing est. Mollit id est magna cillum non amet aute. Et non est id sit ea laborum sit ad fugiat occaecat adipisicing. Irure aliquip dolor deserunt et qui fugiat proident ea esse esse mollit laborum in tempor. Esse exercitation aliqua consectetur ex.

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

incididunt in elit

Ullamco ut velit velit enim ea velit culpa enim incididunt nulla sint dolore. Fugiat culpa commodo culpa amet sunt pariatur. Eu ex sit quis reprehenderit nostrud aliquip est. Minim fugiat nisi dolore eiusmod et amet elit adipisicing fugiat ex. Mollit laborum ipsum non laborum aliquip excepteur est qui. Sit voluptate nostrud aliqua esse aliqua consequat eu veniam sit excepteur excepteur incididunt. Esse consectetur culpa voluptate excepteur sunt.

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)