A Comprehensive Study of iDistance Partitioning Strategies for kNN Queries and High-Dimensional Data Indexing.
Michael A. SchuhTim WylieJuan M. BandaRafal A. AngrykPublished in: BNCOD (2013)
Keyphrases
- high dimensional data
- knn
- nearest neighbor
- k nearest neighbor
- distance computation
- sequential scan
- range queries
- similarity search
- indexing techniques
- similarity queries
- indexing structure
- index structure
- high dimensionality
- nearest neighbor search
- distance function
- b tree
- text categorization
- dimensionality reduction
- database
- data distribution
- support vector machine svm
- data sets
- high dimensional
- k nearest neighbour
- low dimensional
- missing values
- input space
- query processing
- manifold learning
- dimension reduction
- subspace clustering
- high dimensional spaces
- knn algorithm
- clustering high dimensional data
- query point
- data analysis
- metric space
- text classification
- r tree
- feature selection
- data points
- dimensional data
- training set
- neural network
- knn classifier
- nonlinear dimensionality reduction
- support vector machine
- multi dimensional
- sparse representation
- locality sensitive hashing
- locally linear embedding
- support vector
- feature space
- input data
- information retrieval