min-wise independent linear permutations
The aim of the paper is to improve a result on the (exponentially large) family of min-wise independent (linear) permutations which (under some relaxations) are essential to the algorithm used in practice by the AltaVista Web index software to detect and filter near-duplicate documents. The authors obtain a new formula that approximates the expectations over a subset of permutations chosen uniformly at random from the set of min-wise independent linear permutations. This result shows that a simply chosen random linear permutation will suffice for an average set from the point of view of approximate min-wise independence.
- Min-wise independent permutations
- scientific article; zbMATH DE number 1615265 (Why is no real title available?)
- Low discrepancy sets yield approximate min-wise independent permutation families
- scientific article; zbMATH DE number 1775418 (Why is no real title available?)
- Streaming techniques and data aggregation in networks of tiny artefacts
- scientific article; zbMATH DE number 1563190 (Why is no real title available?)
- scientific article; zbMATH DE number 1418262 (Why is no real title available?)
- scientific article; zbMATH DE number 1418263 (Why is no real title available?)
- scientific article; zbMATH DE number 1445298 (Why is no real title available?)
- The exact probability law for the approximated similarity from the Minhashing method
This page was built for publication: min-wise independent linear permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977373)