IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2013-02-22 10:00
Grafting Trees A Nearest Neighbor Srarch Algorithm without Distance Computation
Yohei Ohtani, Toshikazu Wada, Hiroshi Oike (Wakayama Univ.) PRMU2012-162
Abstract (in Japanese) (See Japanese page) 
(in English) This report presents a nearest neighbor search algorithm without distance computation. K-D tree based nearest neighbor search algorithm consists of two processes: 1) determine tentative nearest neighbor data by tree search, and 2) A* algorithm based “priority search” to find true nearest neighbor data to the query. The latter process consumes most computational time especially for high dimensional data distributions. We focus on the fact that the nearest neighbor data is essentially determined by the query position in the feature space and the priority search can be replaced by classifiers. In practice, we employ decision trees as classifiers and attach them to the K-D tree leaf nodes. This data structure is named Grafting trees. On this tree, we can find the nearest neighbor data without distance computation. In this data structure, some decision tree leaves can be very deep. For solving this problem, we modified this data structure forgiving distance computation for such leaf nodes. The modified tree is named Hybrid Grafting trees. In the experiments, we compared ANN library with our methods and confirmed the search time is shorter than ANN.
Keyword (in Japanese) (See Japanese page) 
(in English) Approximate Nearest Neighbor / Voronoi decomposition / K-D Tree / Grafting Trees / Hybrid Grafting Trees / / /  
Reference Info. IEICE Tech. Rep., vol. 112, no. 441, PRMU2012-162, pp. 137-142, Feb. 2013.
Paper # PRMU2012-162 
Date of Issue 2013-02-14 (PRMU) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF PRMU2012-162

Conference Information
Committee PRMU  
Conference Date 2013-02-21 - 2013-02-22 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To PRMU 
Conference Code 2013-02-PRMU 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Grafting Trees A Nearest Neighbor Srarch Algorithm without Distance Computation 
Sub Title (in English)  
Keyword(1) Approximate Nearest Neighbor  
Keyword(2) Voronoi decomposition  
Keyword(3) K-D Tree  
Keyword(4) Grafting Trees  
Keyword(5) Hybrid Grafting Trees  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yohei Ohtani  
1st Author's Affiliation Wakayama University (Wakayama Univ.)
2nd Author's Name Toshikazu Wada  
2nd Author's Affiliation Wakayama University (Wakayama Univ.)
3rd Author's Name Hiroshi Oike  
3rd Author's Affiliation Wakayama University (Wakayama Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2013-02-22 10:00:00 
Presentation Time 30 minutes 
Registration for PRMU 
Paper # PRMU2012-162 
Volume (vol) vol.112 
Number (no) no.441 
Page pp.137-142 
#Pages
Date of Issue 2013-02-14 (PRMU) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan