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...
Autor principal: | Konis, K |
---|---|
Altres autors: | Ripley, B |
Format: | Thesis |
Idioma: | English |
Publicat: |
2007
|
Matèries: |
Ítems similars
-
On auxiliary variables and many-core architectures in computational statistics
per: Lee, A
Publicat: (2011) -
Markov fields and log-linear interaction models for contingency tables
per: Darroch, J, et al.
Publicat: (1980) -
Reweighting methods in high dimensional regression
per: Fang, Z
Publicat: (2012) -
Synonymous codon usage influences the local protein structure observed
per: Saunders, R, et al.
Publicat: (2010) -
Models and software for improving the profitability of pharmaceutical research
per: Qu, S
Publicat: (2011)