A greedy anytime algorithm for sparse PCA.

Guy Holtzman Adam Soffer Dan Vilenchik

Published in: CoRR (2019)

Keyphrases

learning algorithm
dynamic programming
computational complexity
k means
np hard
worst case
recognition algorithm
computer vision
objective function
linear programming
support vector machine svm
face recognition
similarity measure
dimensionality reduction
simulated annealing
greedy algorithm