C E G H I J L M S

C

convert2Set(boolean[]) - Static method in class info.debatty.java.lsh.MinHash

Convert a set represented as an array of booleans to a set of integer.

cosineSimilarity(double[], double[]) - Static method in class info.debatty.java.lsh.SuperBit

Computes the cosine similarity, computed as v1 dot v2 / (|v1| * |v2|).

E

error() - Method in class info.debatty.java.lsh.MinHash

Computes the expected error of similarity computed using signatures.

G

getCoefficients() - Method in class info.debatty.java.lsh.LSHMinHash

Get the coefficients used by internal hashing functions.

getCoefficients() - Method in class info.debatty.java.lsh.MinHash

Get the coefficients used by hash function hi.

getHyperplanes() - Method in class info.debatty.java.lsh.SuperBit

Get the hyperplanes coefficients used to compute signatures.

H

hash(boolean[]) - Method in class info.debatty.java.lsh.LSHMinHash

Bin this vector to corresponding buckets.

hash(double[]) - Method in class info.debatty.java.lsh.LSHSuperBit

Hash (bin) a vector in s stages into b buckets.

hash(int[]) - Method in class info.debatty.java.lsh.LSHSuperBit

Hash (bin) a vector in s stages into b buckets.

hashSignature(int[]) - Method in class info.debatty.java.lsh.LSH

Hash a signature.

hashSignature(boolean[]) - Method in class info.debatty.java.lsh.LSH

Hash a signature.

I

info.debatty.java.lsh - package info.debatty.java.lsh

info.debatty.java.lsh.examples - package info.debatty.java.lsh.examples

InitialSeed - Class in info.debatty.java.lsh.examples

InitialSeed() - Constructor for class info.debatty.java.lsh.examples.InitialSeed

J

jaccardIndex(Set<Integer>, Set<Integer>) - Static method in class info.debatty.java.lsh.MinHash

Compute the jaccard index between two sets.

jaccardIndex(boolean[], boolean[]) - Static method in class info.debatty.java.lsh.MinHash

Compute the exact jaccard index between two sets, represented as arrays of booleans.

L

LARGE_PRIME - Static variable in class info.debatty.java.lsh.LSH

LSH - Class in info.debatty.java.lsh

Implementation of Locality Sensitive Hashing (LSH) principle, as described in Leskovec, Rajaraman & Ullman (2014), "Mining of Massive Datasets", Cambridge University Press.

LSH(int, int) - Constructor for class info.debatty.java.lsh.LSH

Instantiates a LSH instance with s stages (or bands) and b buckets (per stage), in a space with n dimensions.

LSH() - Constructor for class info.debatty.java.lsh.LSH

Instantiate an empty LSH instance (useful only for serialization).

LSHMinHash - Class in info.debatty.java.lsh

LSHMinHash(int, int, int) - Constructor for class info.debatty.java.lsh.LSHMinHash

Instantiates a LSH instance that internally uses MinHash, with s stages (or bands) and b buckets (per stage), for sets out of a dictionary of n elements.

LSHMinHash(int, int, int, long) - Constructor for class info.debatty.java.lsh.LSHMinHash

Instantiates a LSH instance that internally uses MinHash, with s stages (or bands) and b buckets (per stage), for sets out of a dictionary of n elements.

LSHMinHashExample - Class in info.debatty.java.lsh.examples

LSHMinHashExample() - Constructor for class info.debatty.java.lsh.examples.LSHMinHashExample

LSHSuperBit - Class in info.debatty.java.lsh

LSHSuperBit(int, int, int) - Constructor for class info.debatty.java.lsh.LSHSuperBit

LSH implementation relying on SuperBit, to bin vectors s times (stages) in b buckets (per stage), in a space with n dimensions.

LSHSuperBit(int, int, int, long) - Constructor for class info.debatty.java.lsh.LSHSuperBit

LSH implementation relying on SuperBit, to bin vectors s times (stages) in b buckets (per stage), in a space with n dimensions.

LSHSuperBit() - Constructor for class info.debatty.java.lsh.LSHSuperBit

Empty constructor, used only for serialization.

LSHSuperBitExample - Class in info.debatty.java.lsh.examples

LSHSuperBitExample() - Constructor for class info.debatty.java.lsh.examples.LSHSuperBitExample

M

main(String[]) - Static method in class info.debatty.java.lsh.examples.InitialSeed

main(String[]) - Static method in class info.debatty.java.lsh.examples.LSHMinHashExample

main(String[]) - Static method in class info.debatty.java.lsh.examples.LSHSuperBitExample

main(String[]) - Static method in class info.debatty.java.lsh.examples.MinHashExample

main(String[]) - Static method in class info.debatty.java.lsh.examples.SerializeExample

main(String[]) - Static method in class info.debatty.java.lsh.examples.SimpleLSHMinHashExample

main(String[]) - Static method in class info.debatty.java.lsh.examples.SuperBitExample

MinHash - Class in info.debatty.java.lsh

MinHash is a hashing scheme that tents to produce similar signatures for sets that have a high Jaccard similarity.

MinHash(int, int) - Constructor for class info.debatty.java.lsh.MinHash

Initializes hash functions to compute MinHash signatures for sets built from a dictionary of dict_size elements.

MinHash(double, int) - Constructor for class info.debatty.java.lsh.MinHash

Initializes hash function to compute MinHash signatures for sets built from a dictionary of dict_size elements, with a given similarity estimation error.

MinHash(int, int, long) - Constructor for class info.debatty.java.lsh.MinHash

Initializes hash functions to compute MinHash signatures for sets built from a dictionary of dict_size elements.

MinHash(double, int, long) - Constructor for class info.debatty.java.lsh.MinHash

Initializes hash function to compute MinHash signatures for sets built from a dictionary of dict_size elements, with a given similarity estimation error.

MinHashExample - Class in info.debatty.java.lsh.examples

MinHashExample() - Constructor for class info.debatty.java.lsh.examples.MinHashExample

S

SerializeExample - Class in info.debatty.java.lsh.examples

SerializeExample() - Constructor for class info.debatty.java.lsh.examples.SerializeExample

signature(boolean[]) - Method in class info.debatty.java.lsh.MinHash

Computes the signature for this set The input set is represented as an vector of booleans.

signature(Set<Integer>) - Method in class info.debatty.java.lsh.MinHash

Computes the signature for this set.

signature(double[]) - Method in class info.debatty.java.lsh.SuperBit

Compute the signature of this vector.

similarity(int[], int[]) - Method in class info.debatty.java.lsh.MinHash

Computes an estimation of Jaccard similarity (the number of elements in common) between two sets, using the MinHash signatures of these two sets.

similarity(boolean[], boolean[]) - Method in class info.debatty.java.lsh.SuperBit

Compute the similarity between two signature, which is also an estimation of the cosine similarity between the two vectors.

SimpleLSHMinHashExample - Class in info.debatty.java.lsh.examples

SimpleLSHMinHashExample() - Constructor for class info.debatty.java.lsh.examples.SimpleLSHMinHashExample

size(double) - Static method in class info.debatty.java.lsh.MinHash

Computes the size of the signature required to achieve a given error in similarity estimation.

SuperBit - Class in info.debatty.java.lsh

Implementation of Super-Bit Locality-Sensitive Hashing.

SuperBit(int, int, int) - Constructor for class info.debatty.java.lsh.SuperBit

Initialize SuperBit algorithm.

SuperBit(int, int, int, long) - Constructor for class info.debatty.java.lsh.SuperBit

Initialize SuperBit algorithm.

SuperBit(int) - Constructor for class info.debatty.java.lsh.SuperBit

Initialize SuperBit algorithm.

SuperBit() - Constructor for class info.debatty.java.lsh.SuperBit

Initialize SuperBit algorithm without parameters (used only for serialization).

SuperBitExample - Class in info.debatty.java.lsh.examples

SuperBitExample() - Constructor for class info.debatty.java.lsh.examples.SuperBitExample

C E G H I J L M S