Data Summarization: Minhashing and Locality-Sensitive Hashing

Related lectures (32)

Page 1 of 4

Explores privacy-preserving data management and data summarization techniques for finding similar items.

Provides an overview of hashing and sorting techniques in database management systems, focusing on their implementation and performance optimization.

Explores the analysis of running time in hash tables, covering successful searches, key distribution, and table size impact.

Explores probabilistic analysis in algorithms, covering the hiring problem and the birthday paradox, along with hash tables and functions.

Explores hash tables through the Birthday Paradox, collisions, and implementation methods.

Covers the implementation of sets using a naive approach and discusses the inefficiencies of the S list 7 class.

Covers cryptographic hash functions, message authentication codes, and block chains, including bitcoins, proof-of-work, and MAC variants.

Covers the implementation of sets using hashing and set operations.

Explores hashing fundamentals, applications in security, and common attacks on hash functions.

Explores Locality Sensitive Hashing for nearest neighbor search and submodularity in hash functions.