Common · History
MinHash
Data mining technique
In computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was published by Andrei Broder in a 1997 conference, and initially used in the AltaVista search engine to detect duplicate web pages and eliminate them from search results.
From Wikipedia
In computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how similar two sets are. The scheme was published by Andrei Broder in a 1997 conference, and initially used in the AltaVista search engine to detect duplicate web pages and eliminate them from search results. It has also been applied in large-scale clustering problems, such as clustering documents by the similarity of their sets of words.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
★
Linear probing
Collision resolution scheme
-
R★
Rabin–Karp algorithm
String searching algorithm
-
B★
Booth's multiplication algorithm
Algorithm invented by Andrew D. Booth
-
★★★
Bernard Chazelle
French computer scientist
-
★
Bernstein–Vazirani algorithm
Quantum algorithm
-
H★★
Hashcat
Password cracking tool