loading...
Center-Based Indexing for Nearest Neighbors Search
Melbourne, Florida November 19-November 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1251007Third IEEE International Conference o ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Arkadiusz Wojna, "Center-Based Indexing for Nearest Neighbors Search," Data Mining, IEEE International Conference on, pp. 681, Third IEEE International Conference on Data Mining (ICDM'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/ICDM.2003.1251007,
author = {Arkadiusz Wojna},
title = {Center-Based Indexing for Nearest Neighbors Search},
journal ={Data Mining, IEEE International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1978-4},
pages = {681},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1251007},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Mining, IEEE International Conference on
TI - Center-Based Indexing for Nearest Neighbors Search
SN - 0-7695-1978-4
SP
EP
A1 - Arkadiusz Wojna,
PY - 2003
KW - null
VL - 0
JA - Data Mining, IEEE International Conference on
ER -
 
Arkadiusz Wojna, Warsaw University, Poland
The paper addresses the problem of indexing data for the k nearest neighbors (k-nn) search. It presents a tree-based top-down indexing method that uses an iterative k-means algorithm for tree node splitting and combines three different search pruning criteria from BST, GHT and GNAT into one. The experiments show that the presented indexing tree accelerates the k-nn searching up to several thousands times in case of large data sets.
Citation:
Arkadiusz Wojna, "Center-Based Indexing for Nearest Neighbors Search," icdm, pp.681, Third IEEE International Conference on Data Mining (ICDM'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.