Linear programming algorithms for detecting separated data in binary logistic regression models
This thesis is a study of the detection of separation among the sample points in binary logistic regression models. We propose a new algorithm for detecting separation and demonstrate empirically that it can be computed fast enough to be used routinely as part of the fitting process for logistic reg...
Auteur principal: | Konis, K |
---|---|
Autres auteurs: | Ripley, B |
Format: | Thèse |
Langue: | English |
Publié: |
2007
|
Sujets: |
Documents similaires
-
On auxiliary variables and many-core architectures in computational statistics
par: Lee, A
Publié: (2011) -
Markov fields and log-linear interaction models for contingency tables
par: Darroch, J, et autres
Publié: (1980) -
Reweighting methods in high dimensional regression
par: Fang, Z
Publié: (2012) -
Synonymous codon usage influences the local protein structure observed
par: Saunders, R, et autres
Publié: (2010) -
Models and software for improving the profitability of pharmaceutical research
par: Qu, S
Publié: (2011)