Multidimensional access methods
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
RIONA: A New Classification System Combining Rule Induction and Instance-Based Learning
Fundamenta Informaticae
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
IEEE Transactions on Computers
A Data Structure and an Algorithm for the Nearest Point Problem
IEEE Transactions on Software Engineering
Center-based indexing in vector and metric spaces
Fundamenta Informaticae
Similarity search in transaction databases with a two-level bounding mechanism
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Analogy-based reasoning in classifier construction
Transactions on Rough Sets IV
Center-Based Indexing in Vector and Metric Spaces
Fundamenta Informaticae
| Hi-index | 0.00 |
The paper addresses the problem of indexing data forthe k nearest neighbors (k-nn) search. It presents a tree-basedtop-down indexing method that uses an iterative k-meansalgorithm for tree node splitting and combines threedifferent search pruning criteria from BST, GHT and GNATinto one. The experiments show that the presented indexingtree accelerates the k-nn searching up to several thousandstimes in case of large data sets.