Presentation 2006-06-15
Higher-dimensional Nearest Neighbor Search by Distributed Coding
Takao KOBAYASHI, Masaki NAKAGAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper we propose a fast approximate nearest neighbor search algorithm in a high dimensional spherical space using an idea called "distributed coding" which is to represent a vector by a set of many vectors and encode them efficiently. We implemented the algorithm and tested it with synthetic data. The results show that the proposed method exceeds a popular approximate nearest neighbor library, "ANN" in search time and accuracy in the case of higher-dimension and a large number of prototypes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Approximate Nearest Neighbor / Distributed Coding / k-d tree / Locality Sensitive Hashing
Paper # DE2006-3,PRMU2006-41
Date of Issue

Conference Information
Committee DE
Conference Date 2006/6/8(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Higher-dimensional Nearest Neighbor Search by Distributed Coding
Sub Title (in English)
Keyword(1) Approximate Nearest Neighbor
Keyword(2) Distributed Coding
Keyword(3) k-d tree
Keyword(4) Locality Sensitive Hashing
1st Author's Name Takao KOBAYASHI
1st Author's Affiliation 1X Laboratory()
2nd Author's Name Masaki NAKAGAWA
2nd Author's Affiliation Graduate School of Technology, Tokyo University of Agriculture and Technology
Date 2006-06-15
Paper # DE2006-3,PRMU2006-41
Volume (vol) vol.106
Number (no) 97
Page pp.pp.-
#Pages 6
Date of Issue