minimum similarity two items need to have otherwise they are discarded from the result set
number of random vectors (hyperplanes) to generate bit vectors of length d
number of hash rounds. The more the better the approximation but longer the computation.
Find the k nearest neighbours in catalogMatrix for each entry in queryMatrix.
Find the k nearest neighbours in catalogMatrix for each entry in queryMatrix. Implementations may be either exact or approximate.
a row oriented matrix. Each row in the matrix represents an item in the data set. Items are identified by their matrix index.
a row oriented matrix. Each row in the matrix represents an item in the data set. Items are identified by their matrix index.
a similarity matrix with MatrixEntry(queryA, catalogB, similarity).
Standard Lsh implementation. The queryMatrix is hashed multiple times and exact hash matches are searched for in the dbMatrix. These candidates are used to compute the cosine distance.