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
Files download
File Operation
hyperminhash-0.2.jar download
hyperminhash-0.2.pom download
hyperminhash-0.2-sources.jar download
Apache Maven
<dependency>
  <groupId>com.liveramp</groupId>
  <artifactId>hyperminhash</artifactId>
  <version>0.2</version>
</dependency>
Gradle Groovy
implementation 'com.liveramp:hyperminhash:0.2'
Gradle Kotlin
implementation("com.liveramp:hyperminhash:0.2")
Scala SBT
libraryDependencies += "com.liveramp" % "hyperminhash" % "0.2"
Groovy Grape
@Grapes(
  @Grab(group='com.liveramp', module='hyperminhash', version='0.2')
)
Apache Ivy
<dependency org="com.liveramp" name="hyperminhash" rev="0.2" />
Leiningen
[com.liveramp/hyperminhash "0.2"]
Apache Buildr
'com.liveramp:hyperminhash:jar:0.2'