MinHash

Known as: Min-wise independence

In computer science, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating how…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

We present a technique for estimating the size of a statistical population spread across multiple sources. Each sources can…

2018

In the era of big data, the development of location-aware technologies such as mobile communications, sensing devices, and mobile…

2017

. In this paper, we propose a scalable kernel for nodes in a (huge) graph. In contrast with other state-of-the-art kernels that…

2017

We propose a highly efficient and effective algorithm to estimate metrics on very large graphs that are based on the neighborhood…

2015

In many image retrieval systems, re-ranking is an important final step to improve the retrieval accuracy given an initial ranking…

2014

In this paper, we will enlist the process of extracting template from heterogeneous Web Pages. Extracting structured information…

2014

In this paper, we consider the problem of securing mobile-cloud storage services. We design and develop a novel and secure…

2003

A family of permutations ℱ ⊆ Sn with a probability distribution on it is called k‐restricted min‐wise independent if we have Pr…

1999

Session Random 1.- Completeness and Robustness Properties of Min-Wise Independent Permutations.- Low Discrepancy Sets Yield…

1998

Min-wise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The…