.png){kind=icon}
Return
The E-MS Algorithm: Model Selection With Incomplete Data
.png){kind=icon}
OA
AI
DOI：10.1080/01621459.2014.948545.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a procedure associated with the idea of the E-M algorithm for model selection in the presence of missing data. The idea extends the concept of parameters to include both the model and the parameters under the model, and thus allows the model to be part of the E-M iterations. We develop the procedure, known as the E-MS algorithm, under the assumption that the class of candidate models is finite. Some special cases of the procedure are considered, including E-MS with the generalized information criteria (GIC), and E-MS with the adaptive fence (AF; Jiang et al.). We prove numerical convergence of the E-MS algorithm as well as consistency in model selection of the limiting model of the E-MS convergence, for E-MS with GIC and E-MS with AF. We study the impact on model selection of different missing data mechanisms. Furthermore, we carry out extensive simulation studies on the finite-sample performance of the E-MS with comparisons to other procedures. The methodology is also illustrated on a real data analysis involving QTL mapping for an agricultural study on barley grains. Supplementary materials for this article are available online.
Keywords:
Backcross experiments
Conditional sampling
Consistency
Convergence
Missing data mechanism
Model selection
Regression
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3
Papers:
5.2K
Citations:
4.8W
Organization
View more organizations
Cited Papers
ShareSave
ShareSaveSFP genotyping from Affymetrix arrays is robust but largely detects cis-acting expression regulators.png)
GENETICSOAAI
GENETICSIF5.1
OAAIShareSaveShareSaveShareSaveA model selection approach for the identification of quantitative trait loci in experimental crossesOAAI
OAAIShareSaveShareSave View more