h

hyperminhash

HyperMinHash is a probabilistic data structure that can approximate union, intersection, and set cardinalities as well as Jaccard indices of very large sets with high accuracy, in loglog space, and in a streaming fashion.
www.github.com/LiveRamp/HyperMinHash-java
Apache 2
LiveRamp
Christian Hansen Harry Rackmil Shrif Nada
streaming loglog intersection fashion with structure jaccard data well space hyperminhash that union indices cardinalities approximate sets high probabilistic accuracy large very
大版本 版本 最近更新
0.2 0.2 2019-02-16 16:28:05
0.1 0.1 2019-01-21 19:00:55
共2条记录