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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on knowledge and data engineering Ročník 34; číslo 7; s. 3491 - 3506
Hlavný autor:	Ertl, Otmar
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.07.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!