Machine learningMissing data
矩阵填充
矩阵填充是一种从其少量、可能随机的条目子集中恢复低秩矩阵的技术。该技术由 Emmanuel Candès 和 Benjamin Recht 于 2009 年提出，它将问题重新表述为核范数最小化——这是秩最小化的凸松弛——并提供了理论保证，即当条目均匀随机观测且矩阵满足不相干条件时，可以实现精确恢复。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Candès, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717–772. DOI: 10.1007/s10208-009-9045-5 ↗
如何引用本页
ScholarGate. (2026, June 2). Low-Rank Matrix Completion. ScholarGate. https://scholargate.app/zh/machine-learning/matrix-completion
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →