ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

MICE×矩阵填充×
领域统计学机器学习
方法族Process / pipelineMachine learning
起源年份20112009
提出者Stef van Buuren & Karin Groothuis-OudshoornEmmanuel Candès & Benjamin Recht
类型Iterative multiple imputation algorithmConvex low-rank recovery
开创性文献van Buuren, S., & Groothuis-Oudshoorn, K. (2011). mice: Multivariate imputation by chained equations in R. Journal of Statistical Software, 45(3), 1–67. DOI ↗Candès, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717–772. DOI ↗
别名Fully Conditional Specification, Sequential Regression Multivariate Imputation, Chained Equations Imputation, Zincirleme Denklemlerle Çoklu AtamaNuclear Norm Minimization, Collaborative Filtering via Low-Rank Recovery, Inductive Matrix Completion, Matris Tamamlama
相关32
摘要Multivariate Imputation by Chained Equations (MICE) is an iterative procedure for handling missing data in multivariate datasets. Introduced by Stef van Buuren and Karin Groothuis-Oudshoorn through the R package mice (2011), the algorithm fills each missing variable using a separate regression model conditioned on all other variables, cycling through variables repeatedly until the imputed values converge. The result is m completed datasets that are analysed separately and combined using Rubin's rules.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.
ScholarGate数据集
  1. v1
  2. 1 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: MICE · Matrix Completion. 于 2026-06-17 检索自 https://scholargate.app/zh/compare