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

compile

|-- org.apache.commons:commons-math3:3.4.1

test

|-- junit:junit:4.12