.png){kind=icon}
Return
Improved likelihood inference for discrete data
.png){kind=icon}
OA
AI
DOI：10.1111/j.1467-9868.2006.00548.x.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Discrete data, particularly count and contingency table data, are typically analysed by using methods that are accurate to first order, such as normal approximations for maximum likelihood estimators. By contrast continuous data can quite generally be analysed by using third-order procedures, with major improvements in accuracy and with intrinsic separation of information concerning parameter components. The paper extends these higher order results to discrete data, yielding a methodology that is widely applicable and accurate to second order. The extension can be described in terms of an approximating exponential model that is expressed in terms of a score variable. The development is outlined and the flexibility of the approach is illustrated by examples.
Keywords:
binary regression
categorical data
conditional inference
contingency tables
likelihood
negative binomial
non-canonical link function
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.6
Papers:
1.5K
Citations:
3.2W
Organization
No organization information available
Cited Papers
Emergency medical services education research priorities during COVID‐19: A modified Delphi study.png)
JACEP OpenOAAI
JACEP OpenIF0
OAAIShareSaveShareSaveShareSave
ShareSaveShareSave
View more