Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities.
Michael B. CohenPublished in: SODA (2016)
Keyphrases
- low dimensional
- dimensionality reduction
- high dimensional data
- hilbert space
- lower bound
- manifold learning
- principal component analysis
- subspace learning
- high dimensional
- upper bound
- euclidean space
- feature space
- sufficient conditions
- lower dimensional
- clustering high dimensional data
- worst case
- linear subspace
- subspace clustering
- valid inequalities
- linear inequalities
- low dimensional spaces
- vector space
- higher dimensional
- feature extraction
- planar graphs
- cutting plane algorithm
- data points
- independent component analysis
- subspace methods
- linear programming
- distance measure
- nearest neighbor
- pattern recognition