#include <boost/program_options.hpp>
#include <boost/progress.hpp>
#include <boost/format.hpp>
#include <boost/timer.hpp>
#include <lshkit.h>
Functions | |
int | main (int argc, char *argv[]) |
This program is an example of using LSH Forest index. The LSH used is LSB<GaussianLsh>, so the trees in the forest are binary trees.
The current implementation of LSH Forest doesn't allow read/write index files.
Allowed options: -h [ --help ] produce help message. -c [ -- ] arg (=20) # points to scan from each tree -L [ -- ] arg (=1) number of trees -D [ -- ] arg (=10) maximal depth of tree -W [ -- ] arg (=1) hash function window size -Q [ -- ] arg (=100) number of queries to use -K [ -- ] arg (=50) number of nearest neighbors to retrieve -R [ -- ] arg (=3.40282347e+38) R-NN distance range -D [ --data ] arg dataset path -B [ --benchmark ] arg