Fast high-dimensional approximation with sparse occupancy trees.
Peter BinevWolfgang DahmenPhilipp LambyPublished in: J. Comput. Appl. Math. (2011)
Keyphrases
- high dimensional
- sparse data
- low dimensional
- similarity search
- dimensionality reduction
- decision trees
- data points
- high dimensionality
- searching in metric spaces
- metric space
- feature space
- multi dimensional
- additive models
- sparse approximation
- sparse coding
- manifold learning
- high dimensional data
- nearest neighbor
- high dimension
- data structure
- error bounds
- variable selection
- high dimensional problems
- noisy data
- tree construction
- nearest neighbor search
- parameter space
- dimension reduction
- microarray data
- generalized linear models
- data sets
- image classification
- input space
- image reconstruction
- tree structure
- sparse representation
- kernel function