Approximate Nearest Neighbor Search Based on a Multi-ValuedExpression of Closeness

LanguageJapanese
TypeProceedings of Japanese Conferences
AuthorsMasashi Tada, Tomoyuki Muto, Masakazu Iwamura, Koichi Kise
TitleApproximate Nearest Neighbor Search Based on a Multi-ValuedExpression of Closeness
JournalIEICE Technical Report
Presentation numberPRMU2009-110
Pagespp.121-126
DateNovember 2009
Research fieldsNearest Neighbor Search
KeyTada2009 (id=1126)

Abstract

Approximate nearest neighbor search is a technique which greatly reduces processing time and required amount of memory for nearest neighbor search. In this paper, we propose two methods which achieve the same accuracy, with less processing time and less required amount of memory compared to existing methods such as LSH and PCH. The first one achieved about 50% of processing time as compared to LSH by using multi-valued information for improving processing efficiency. The second one achieved about 50% of required amount of memory and about 50% of processing time as compared to LSH by eliminating distance calculation process which is requisite for existing methods.

Files

Export this publication

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:

{authors}{authors_and}{authors_ja}{authors_ja_tight}{authors_en}{authors_en_and}{authors_tight}{first_author}{title}{title_ja}{title_en}{journal}{journal_ja}{journal_en}{book_title}{volume}{number}{series}{presen_id}{pages}{pp}{num_pages}{year}{month}{month_en}{month_short}{ym}{date}{date_ja}{date_en}{publisher}{address}{location}{review}{review_ja}{review_en}{reviewed_mark}{presen_type}{type}{type_label}{doi}{url}{key}{awards}

← Back to list