Locality Sensitive Hashing (LSH) is one of the most popular methods of the approximate near neighbor search. In applications that require the nearest neighbors of queries in a short time, LSH is sometimes used in pruning of the candidates of nearest neighbors. While the pruning reduces the processing time greatly, it also reduces the chances of retrieving the exact nearest neighbors.
However, the pruning of nearest neighbor candidates using LSH has not
been considered theoretically. Thus in this paper, we investigate the pruning effect by deriving the formulae of retrieval accuracy and computational cost of distance calculation for uniformly distributed data. Furthermore, we make evaluations on the formulae by comparison between simulation results and the theoretical values.
Files
…
Export this publication
Tab-separated. Paste into the sheet starting at column A. Required fields that cannot be inferred are left blank.
Format definition
Edits apply immediately and stay in effect until you pick a style again or reset. First line is the default; add lines like "book: …" to override per type.
How to write the definition
Insert a field with braces like {authors}. A part enclosed in [ ... ] is omitted entirely when any field inside it is empty. Available fields:
One macro per line as \name{field}{field}…. A field name in braces is replaced by its (LaTeX-escaped) value; other text is kept. Rename macros or add lines freely — they appear in the macro selector. A line like master_thesis: thesis fixes the macro for a type (automatic choice: journals use paperdoi with a DOI, paperno with a number, else paper; conferences conf with pages, else confpaper; books book). {pages} comes as 119--124; {journal} falls back to the book title. Fields: