Lecture

Data Summarization: Minhashing and Locality-Sensitive Hashing

In course

Excepteur labore ea tempor consequat ad quis Lorem ex excepteur et. Ad deserunt sunt cillum fugiat sint. Lorem ut deserunt nostrud dolor qui Lorem laboris dolor pariatur eiusmod cupidatat qui.

Description

This lecture covers the concepts of Jaccard similarity, minhashing, and locality-sensitive hashing for data summarization. It explains how to find similar items using Jaccard similarity and bitvectors, and how to reduce false positives and negatives in similarity detection. The lecture also delves into the construction of hash functions and the application of cosine distance for document similarity.

Instructor

Laborum et laboris tempor cupidatat nostrud aliquip commodo veniam. Eiusmod ad velit consectetur exercitation magna minim exercitation non. Eiusmod consequat cupidatat proident Lorem irure esse duis enim cupidatat nostrud et tempor laborum aute. Nulla eiusmod ad ad occaecat mollit eiusmod nisi labore minim sit. Aute cupidatat elit minim velit reprehenderit ipsum eu ipsum ullamco aute laborum mollit.

Official source

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

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.

Related lectures (32)

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.