On maximum likelihood estimation in sparse contingency tables (Q1080593)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On maximum likelihood estimation in sparse contingency tables |
scientific article; zbMATH DE number 3967705
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On maximum likelihood estimation in sparse contingency tables |
scientific article; zbMATH DE number 3967705 |
Statements
On maximum likelihood estimation in sparse contingency tables (English)
0 references
1983
0 references
Log-linear and logistic models can be fitted to data in contingency tables either by an iterative-proportional fitting algorithm or by an iteratively reweighted Newton-Raphson algorithm. Both algorithms provide maximum likelihood (ML) estimates of the expected cell frequencies and of the parameters of the model. When random zeros occur in the contingency table, numerical problems may be encountered in obtaining the ML estimates when using one or both of the algorithms. Problems in the estimation of the model's parameters, expected cell frequencies and degrees of freedom are described. An explicit formula is given for the evaluation of the degrees of freedom.
0 references
maximum likelihood estimation
0 references
log-linear model
0 references
logistic models
0 references
contingency tables
0 references
iterative-proportional fitting algorithm
0 references
iteratively reweighted Newton-Raphson algorithm
0 references
random zeros
0 references
expected cell frequencies
0 references
degrees of freedom
0 references