পদ্ধতির তুলনা করুন

	Locally Linear Embedding (LLE)	ম্যাট্রিক্স কমপ্লিশন
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2000	2009
প্রবর্তক	Sam Roweis & Lawrence Saul	Emmanuel Candès & Benjamin Recht
ধরন	Nonlinear manifold dimensionality reduction	Convex low-rank recovery
মৌলিক উৎস	Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500), 2323–2326.	Candès, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717–772.
অপর নাম	LLE, manifold learning, nonlinear dimensionality reduction, yerel doğrusal gömme	Nuclear Norm Minimization, Collaborative Filtering via Low-Rank Recovery, Inductive Matrix Completion, Matris Tamamlama
সম্পর্কিত	3	2
সারসংক্ষেপ	Locally linear embedding, introduced by Sam Roweis and Lawrence Saul in 2000, is a manifold-learning method for nonlinear dimensionality reduction. It assumes that although data may curve through a high-dimensional space, each point and its neighbours lie approximately on a flat patch. LLE captures each point as a weighted combination of its neighbours and then finds a low-dimensional layout that preserves those same local relationships, unrolling curved structure into a faithful low-dimensional map.	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.