[KongchangAI]
Concept最小哈希

MinHash

A locality-sensitive hashing algorithm based on random hashing, used to quickly estimate the Jaccard similarity between sets. It is widely applied in scenarios such as recommendation systems, deduplication, and clustering.

Timeline (last 90 days)

Oct 14

CMinHash is a MinHash algorithm designed through circulant permutation, which can reduce both variance and storage space.

Unverified50%
Oct 14

The theoretical basis of MinHash is: if a random permutation is applied to set elements, then the probability that the respective minimum hash values of two sets are equal is exactly equal to their Jaccard similarity.

Unverified50%
Oct 14

The Minner estimator is an improved scheme in the MinHash family that further reduces variance by combining multiple minimum hash values, and typically has lower variance than standard MinHash under the same hash budget.

Unverified50%
Oct 14

The introduction of circulant permutation makes MinHash more attractive in storage-constrained scenarios (such as embedded devices and large-scale distributed systems).

Unverified50%
Oct 12

在文档摄入中,每个文档生成MD5哈希作为document_id,内容哈希用于精确去重,生产环境建议加入MinHash做近似去重,失败文档进入死信队列支持断点续传。

Unverified50%
Sep 11

After data deduplication (using locality-sensitive hashing algorithms such as MinHash and SimHash), model convergence speed can improve by 10–20%.

Unverified50%

All Facts (6)

Source Articles