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/ja/compare