Efficient Approximate Nearest Neighbor Search Based on Accessing Neighboring Buckets
Language
Japanese
Type
Proceedings of Japanese Conferences
Authors
Tomoyuki Muto, Masashi Tada, Masakazu Iwamura, Koichi Kise
Title
Efficient Approximate Nearest Neighbor Search Based on Accessing Neighboring Buckets
Journal
IEICE Tecnical Report
Presentation number
PRMU2009-53
Pages
pp.83-88
Date
June 2009
Research fields
Nearest Neighbor Search
Key
Muto2009_IEICEPRMU (id=1092)
Abstract
Approximate nearest neighbor search is a technique which greatly
reduces processing time and required amount of memory
for nearest neighbor search.
Further reduction of required amount of memory
of the approximate nearest neighbor search
is an important task.
In this paper, we model a method to
access neighboring buckets,
and reveal the method requires less amount of memory than LSH
by an experiment and analysis.
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: