Comparer des méthodes

	Projection aléatoire	Achèvement de matrice
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	1984	2009
Auteur d'origine	Johnson & Lindenstrauss (lemma); Achlioptas (sparse variant)	Emmanuel Candès & Benjamin Recht
Type	Linear, data-oblivious dimensionality reduction	Convex low-rank recovery
Source fondatrice	Johnson, W. B., & Lindenstrauss, J. (1984). Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics, 26, 189–206.	Candès, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717–772.
Alias	random projections, Johnson-Lindenstrauss projection, sparse random projection, rastgele izdüşüm	Nuclear Norm Minimization, Collaborative Filtering via Low-Rank Recovery, Inductive Matrix Completion, Matris Tamamlama
Apparentées	2	2
Résumé	Random projection reduces dimensionality by multiplying the data by a random matrix, relying on the Johnson-Lindenstrauss lemma (1984), which guarantees that projecting onto enough random directions approximately preserves all pairwise distances. Unlike PCA it does not analyze the data at all — the projection is random and data-oblivious — making it extremely cheap and well suited to very high-dimensional data and streaming or privacy-sensitive settings.	Matrix Completion is a technique for recovering a low-rank matrix from a small, possibly random subset of its entries. Introduced by Emmanuel Candès and Benjamin Recht in 2009, it reformulates the problem as nuclear norm minimization — a convex surrogate for rank minimization — and provides theoretical guarantees that exact recovery is achievable when entries are observed uniformly at random and the matrix satisfies an incoherence condition.