Exploiting Sample-Data Distributions to Reduce the Cost of Nearest-Neighbor Searches with Kd-Trees.
Douglas A. TalbertDouglas H. FisherPublished in: IDA (1999)
Keyphrases
- data distribution
- nearest neighbor
- kd trees
- nearest neighbor search
- index structure
- kd tree
- high dimensional data
- data points
- high dimensional spaces
- space partitioning
- k nearest neighbor
- data streams
- knn
- high dimensional
- r tree
- data structure
- range queries
- distance function
- query plan
- neural network
- hash functions
- indexing techniques
- high dimensionality
- multi dimensional
- training set
- database systems
- parallel algorithm
- tree structure
- dimensional data
- pattern recognition
- approximate nearest neighbor
- database