Algorithms and Hardness for Subspace Approximation
Amit DeshpandeKasturi R. VaradarajanMadhur TulsianiNisheeth K. VishnoiPublished in: CoRR (2009)
Keyphrases
- computational complexity
- learning algorithm
- high dimensional
- computationally efficient
- worst case
- times faster
- data structure
- error bounds
- combinatorial optimization
- theoretical analysis
- computational efficiency
- principal component analysis
- computational problems
- approximation error
- computational cost
- significant improvement
- feature space
- bayesian networks