ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity

The probability Jaccard similarity was recently proposed as a natural generalization of the Jaccard similarity to measure the proximity of sets whose elements are associated with relative frequencies or probabilities. In combination with a hash algorithm that maps those weighted sets to compact sign...

Full description

Bibliographic Details

Published in:	IEEE transactions on knowledge and data engineering Vol. 34; no. 7; pp. 3491 - 3506
Main Author:	Ertl, Otmar
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.07.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Clustering Clustering algorithms Device-to-device communication Estimation error Indexes Jaccard similarity locality-sensitive hashing Measurement Minwise hashing probabilistic data structures Similarity Statistical analysis streaming algorithms Time complexity
ISSN:	1041-4347, 1558-2191
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!