DocumentCode
2371067
Title
Center-based indexing for nearest neighbors search
Author
Wojna, Arkadiusz
Author_Institution
Inst. of Inf., Warsaw Univ., Poland
fYear
2003
fDate
19-22 Nov. 2003
Firstpage
681
Lastpage
684
Abstract
We address the problem of indexing data for the k nearest neighbors (k-nn) search. We present 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.
Keywords
database indexing; tree data structures; tree searching; very large databases; K nearest neighbors search; center-based data indexing; data sets; iterative k-means algorithm; search pruning criteria; tree node splitting; tree-based top-down indexing; Acceleration; Binary search trees; Data mining; Databases; Indexing; Informatics; Iterative algorithms; Iterative methods; Nearest neighbor searches; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining, 2003. ICDM 2003. Third IEEE International Conference on
Print_ISBN
0-7695-1978-4
Type
conf
DOI
10.1109/ICDM.2003.1251007
Filename
1251007
Link To Document