Duplicate Registration of Data in Approximate Nearest Neighbor
Language
Japanese
Type
Proceedings of Japanese Conferences
Authors
Masakazu Iwamura, Tomoyuki Mutoh, Koichi Kise
Title
Duplicate Registration of Data in Approximate Nearest Neighbor
Journal
IEICE Technical Report
Location
神奈川県横浜市
Reviewed
Not reviewed
Presentation type
Oral
Date
June 2011
Research fields
Nearest Neighbor Search
Key
Iwamura2011_IEICE (id=1216)
Abstract
We propose a new method based on duplicate registration of data
in approximate nearest neighbor problem.
In the experiment, the proposed method achieved the same accuracy as
a conventional method, LSH,
with 18\% of computational cost and 90\% of memory usage needed for
LSH.
In addition, we consider the phenomenon based on the
criterion $\rho$ of efficiency of LSH appeared in [1].
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: