Presentation 2001/7/11
Static Indexing on Searching in Chained Neighborhood Points
Yasuhiro Sato, Satoru Tanaka, Motomichi Toyama,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is convenient if it is classified according to a certain standard in case a reference result is shown to users. But, since it is difficult for users to grasp the required amount of the features correctly, the structure which users tend to acquire required information and become by the system side is required. Chained neighborhood Points make it possible to navigate users to their required information without requiring any complex parameter for them. In this paper, we propose the static construction method of the Chained Neighborhood Points, and describe the reference and the updating method in case of static indexing.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) nearest neighbor search / similarity retrieval / multi-dimensional space / indexing technique
Paper # DE2001-64
Date of Issue

Conference Information
Committee DE
Conference Date 2001/7/11(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) Static Indexing on Searching in Chained Neighborhood Points
Sub Title (in English)
Keyword(1) nearest neighbor search
Keyword(2) similarity retrieval
Keyword(3) multi-dimensional space
Keyword(4) indexing technique
1st Author's Name Yasuhiro Sato
1st Author's Affiliation School of Science for OPEN and Environmental Systems, Faculty of Science and Technology, Keio University()
2nd Author's Name Satoru Tanaka
2nd Author's Affiliation TIS Inc.
3rd Author's Name Motomichi Toyama
3rd Author's Affiliation Department of Information and Computer Science, Faculty of Science and Technology, Keio University. PRESTO, JST
Date 2001/7/11
Paper # DE2001-64
Volume (vol) vol.101
Number (no) 192
Page pp.pp.-
#Pages 6
Date of Issue