Sparse nonnegative matrix approximation: new formulations and algorithms
Ravi Tandon, Suvrit Sra · MPG.PuRe (Max Planck Society) · 2010
We introduce several new formulations for sparse nonnegative matrix approximation. Subsequently, we solve these formulations by developing generic algorithms. Further, to help selecting a particular sparse formulation, we briefly discuss the interpretation of each formulation. Finally, preliminary experiments are presented to illustrate the behavior of our formulations and algorithms.