public interface LSH
Modifier and Type  Method and Description 

INDArray 
bucket(INDArray query)
Returns the set of all vectors that could approximately be considered negihbors of the query,
without selection on the basis of distance or number of neighbors.

java.lang.String 
getDistanceMeasure()
Returns an instance of the distance measure associated to the LSH family of this implementation.

int 
getHashLength()
Returns the size of a hash compared against in one hashing bucket, corresponding to an AND construction
denoting hashLength by h,
amplifies a (d1, d2, p1, p2) hash family into a
(d1, d2, p1^h, p2^h)sensitive one (match probability is decreasing with h)

int 
getInDimension() 
int 
getNumTables()
denoting numTables by n,
amplifies a (d1, d2, p1, p2) hash family into a
(d1, d2, (1p1^n), (1p2^n))sensitive one (match probability is increasing with n)

void 
makeIndex(INDArray data)
Populates the index with data vectors.

INDArray 
search(INDArray query,
double maxRange)
Returns the approximate neighbors within a distance bound.

INDArray 
search(INDArray query,
int k)
Returns the approximate neighbors within a kclosest bound

java.lang.String getDistanceMeasure()
int getHashLength()
int getNumTables()
int getInDimension()
void makeIndex(INDArray data)
data
 the vectors to indexINDArray bucket(INDArray query)
query
 a vector to find neighbors forINDArray search(INDArray query, double maxRange)
query
 a vector to find neighbors formaxRange
 the maximum distance between results and the query