Extensions of Approximate Nearest Neighbor Search Based on a Multi-Valued Expression of Closeness to General Distributions

LanguageJapanese
TypeProceedings of Japanese Conferences
AuthorsMasashi Tada, Tomoyuki Muto, Masakazu Iwamura, Koichi Kise
TitleExtensions of Approximate Nearest Neighbor Search Based on a Multi-Valued Expression of Closeness to General Distributions
JournalProc. First Forum on Data Engineering and Information Management
Presentation numberF3-2
DateFebruary 2010
Research fieldsNearest Neighbor Search
KeyTada2010_FDEI (id=1139)

Abstract

Approximate nearest neighbor search is a technique which greatly reduces processing time and required amount of memory for nearest neighbor search. We proposed two approximate nearest neighbor methods: MVH1 and MVH2. We comfirmed the effectiveness of these methods for uniform distribution with L1 norm. In this report, we get rid of the restrictions of these methods and propose efficient methods for Lp norm and general distributions. For L2 norm, improved MVH1 achived about 75% of processing time of LSH. Improved MVH2 achived about 50% of required amount of memory of LSH.

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