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.
Nº Q11091745 ★
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
Nº Q2988094 ★
Not listed
-
R
Rabin–Karp algorithm
String searching algorithm
Nº Q1384131 ★
Not listed
-
B
Booth's multiplication algorithm
Algorithm invented by Andrew D. Booth
Nº Q477049 ★
Not listed
-
Bernard Chazelle
French computer scientist
Nº Q892115 ★★★
Not listed
-
Bernstein–Vazirani algorithm
Quantum algorithm
Nº Q65053013 ★
Not listed
-
H
Hashcat
Password cracking tool
Nº Q17081377 ★★
Not listed