Exploiting lower bounds to accelerate approximate nearest neighbor search on high-dimensional data.
Yingfan LiuHao WeiHong ChengPublished in: Inf. Sci. (2018)
Keyphrases
- high dimensional data
- approximate nearest neighbor search
- nearest neighbor
- lower bound
- similarity search
- nearest neighbor search
- kd tree
- knn
- k nearest neighbor
- high dimensionality
- high dimensional
- hash functions
- locality sensitive hashing
- data points
- metric space
- objective function
- subspace clustering
- distance function
- high dimensional spaces
- dimensionality reduction
- data analysis
- clustering high dimensional data
- data distribution
- data sets
- low dimensional
- index structure
- training set
- dimensional data
- vector space
- optimal solution
- computer vision