Data Summarization: Minhashing and Locality-Sensitive Hashing

Related lectures (32)

Page 2 of 4

Explores pairwise independence in hashing to avoid collisions and achieve load balancing.

Explores hash collisions, attacks on hash functions, and strategies for exploiting them in file formats like JPEG and PDF.

Covers the analysis of hash tables, including search operations and expected collisions.

Introduces hashing tables, including the Birthday Lemma, Direct-Address Tables, collisions, and Chained-Hash-Search.

Covers counting distinct elements using hash functions and the median trick.

Covers the Chord DHT in decentralized systems engineering, focusing on reliability, redundancy, and structure maintenance.

Covers operations and methods related to dictionaries in Python, including creating, updating, and handling key errors.

Discusses the evaluation of binary classifiers, including recall, sensitivity, specificity, ROC curves, and performance measures.

Covers the implementation details of hash sets and related methods using IntelliJ IDEA.

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.