Manifold learning algorithms make an effort to do so under the constraint that the realized representation is lower-dimensional. Sparse coding algorithms attempt to do so under the constraint that the discovered illustration is sparse, meaning that the mathematical model has many zeros. Multilinear subspace learning algorithms aim to understand red