A Bidirectional Greedy Heuristic for the Subspace Selection Problem.
Dag HauglandPublished in: SLS (2007)
Keyphrases
- greedy heuristic
- np hard
- greedy algorithm
- knapsack problem
- minimum weight
- low dimensional
- optimal solution
- set cover
- subspace clustering
- high dimensional data
- principal component analysis
- worst case analysis
- subspace learning
- feature extraction
- subspace methods
- principal components analysis
- dimensionality reduction
- clustering high dimensional data
- lower bound
- feature space
- lower dimensional
- linear subspace
- face recognition
- database
- approximation algorithms
- clustering method
- dynamic programming
- eigendecomposition
- similarity measure
- data sets
- real time