Fast Supervised Hashing with Decision Trees for High-Dimensional Data.
Guosheng LinChunhua ShenQinfeng ShiAnton van den HengelDavid SuterPublished in: CoRR (2014)
Keyphrases
- high dimensional data
- decision trees
- similarity search
- nearest neighbor
- high dimensional
- dimensionality reduction
- subspace clustering
- data sets
- nearest neighbor search
- low dimensional
- high dimensions
- original data
- data points
- data analysis
- high dimensionality
- clustering high dimensional data
- dimension reduction
- machine learning
- random projections
- hash functions
- semi supervised
- unsupervised learning
- data structure
- linear discriminant analysis
- nonlinear dimensionality reduction
- input space
- supervised learning
- learning algorithm
- binary codes
- input data
- high dimensional datasets
- sparse representation
- dimensional data
- data distribution
- training set
- text data
- hamming distance
- lower dimensional
- high dimensional spaces
- locality sensitive hashing
- computer vision
- index structure
- subspace learning
- multi dimensional
- feature extraction
- face recognition
- supervised dimensionality reduction
- neural network