Logistic Regression in Cases of Separation by Means of Penalized Maximum Likelihood Estimation
Users of –logit- or –logistic- occasionally encounter instances in which one or more predictors perfectly predict one or both outcomes (a condition called separation), or in which some outcomes are completely determined (quasicomplete separation). Finite maximum likelihood estimates do not exist under conditions of separation. Exact logistic regression with –exlogistic- can serve as an alternative in these circumstances, but is sometimes not feasible. In the 1990s, David Firth proposed a type of penalization for reducing bias of maximum likelihood estimates in generalized linear models by means of modifying the score equations. Firth’s method has the interpretation of penalized maximum likelihood when the canonical link function is used, such as in logistic regression. In this decade, Georg Heinze and colleagues have explored this technique as a solution to the problem of separation in logistic regression. A Stata implementation, -firthlogit-, which maximizes the log penalized likelihood using –ml-, is described here. Model fitting and predictions, inference with penalized likelihood ratio tests, and construction of profile penalized likelihood confidence intervals is illustrated using examples where –logit- and –logistic- either balk or do not give finite maximum likelihood estimates, and where exact logistic regression is problematic because of memory requirements or degenerate conditional distributions.
|Date of creation:||29 Jul 2008|
|Date of revision:||24 Sep 2008|
|Contact details of provider:|| Web page: http://stata.com/meeting/snasug08/|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:boc:nsug08:10. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F Baum)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.