Decomposition and manifold learning#
PCA, SVD, matrix factorizations and embeddings for visualization.
Implicit-feedback matrix factorization by alternating least squares. |
|
Canonical correlation analysis. |
|
Classical (Torgerson) multidimensional scaling. |
|
Learn a dictionary in which the data has a sparse representation. |
|
Outlier detection for Gaussian-distributed data. |
|
Factor analysis: a linear Gaussian latent variable model. |
|
Independent component analysis with the FastICA algorithm. |
|
Reduce dimension with a Gaussian random matrix. |
|
Incremental principal component analysis, fitted batch by batch. |
|
Isomap embedding: kernel PCA on geodesic distances. |
|
Minimum dimension for a random projection that keeps distances within eps. |
|
Latent Dirichlet allocation topic model, fitted by variational EM. |
|
Locally linear embedding. |
|
Least-squares solution of |
|
LU factorization of a square matrix with partial pivoting. |
|
Solve a linear system from an LU factorization. |
|
Manifold learning: spectral embedding (Laplacian eigenmaps) and UMAP. |
|
Multidimensional scaling by SMACOF. |
|
Minimum covariance determinant: a robust covariance estimator. |
|
Learn a sparse-coding dictionary from mini-batches. |
|
Sparse principal component analysis fitted on mini-batches. |
|
Non-negative matrix factorization |
|
Principal component analysis. |
|
Partial least squares in canonical form. |
|
Partial least squares regression. |
|
Truncated SVD by randomized range finding. |
|
Solve the square linear system |
|
Sparse-code each row of X against a fixed dictionary. |
|
Sparse coding against a fixed, precomputed dictionary. |
|
Sparse principal component analysis. |
|
Reduce dimension with a sparse random matrix. |
|
Dimensionality reduction by truncated singular value decomposition. |
|
Uniform Manifold Approximation and Projection (UMAP) embedding. |
|
UMAP: Uniform Manifold Approximation and Projection. |