Admin: Created page with "'''SimHash''' is a technique for quickly estimating how similar two sets are. The algorithm is used by the Google Crawler to fin..."

2019-07-16T08:46:03Z

Created page with "'''SimHash''' is a technique for quickly estimating how similar two sets are. The algorithm is used by the Google Crawler to fin..."

New page

'''SimHash''' is a technique for quickly estimating how [[Similarity measure|similar]] two sets are. The [[algorithm]] is used by the [[Google]] [[Web crawler|Crawler]] to find near duplicate pages. It was created by [[Moses Charikar]].

==Evaluation and benchmarks==
A large scale evaluation has been conducted by [[Google]] in 2006 to compare the performance of Minhash and [[Simhash]] algorithms. In 2007 Google reported using Simhash for duplicate detection for web crawling and using Minhash and [[Locality-sensitive hashing|LSH]] for [[Google News]] personalization.

==See also==
*[[MinHash]]
*[[w-shingling]]
*[[Count-min sketch]]

==Source==

[http://wikipedia.org/ http://wikipedia.org/]

[[Category:Cryptographic algorithms]]

SimHash - Revision history

Admin: Created page with "'''SimHash''' is a technique for quickly estimating how similar two sets are. The algorithm is used by the Google Crawler to fin..."