An improved approximation algorithm for the column subset selection problem.
Christos BoutsidisMichael W. MahoneyPetros DrineasPublished in: SODA (2009)
Keyphrases
- detection algorithm
- computational complexity
- dynamic programming
- preprocessing
- learning algorithm
- np hard
- optimization algorithm
- particle swarm optimization
- theoretical analysis
- experimental evaluation
- cost function
- matching algorithm
- times faster
- error bounds
- path planning
- initial set
- neural network
- approximation ratio
- worst case
- special case
- significant improvement
- association rules
- optimal solution
- rough sets
- mobile robot
- monte carlo
- k means
- data structure
- convex hull
- recognition algorithm
- objective function
- clustering algorithm