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 |
---|---|
Outros Autores: | Ripley, B |
Formato: | Thesis |
Idioma: | English |
Publicado em: |
2007
|
Assuntos: |
Registos relacionados
-
On auxiliary variables and many-core architectures in computational statistics
Por: Lee, A
Publicado em: (2011) -
Markov fields and log-linear interaction models for contingency tables
Por: Darroch, J, et al.
Publicado em: (1980) -
Reweighting methods in high dimensional regression
Por: Fang, Z
Publicado em: (2012) -
Synonymous codon usage influences the local protein structure observed
Por: Saunders, R, et al.
Publicado em: (2010) -
Models and software for improving the profitability of pharmaceutical research
Por: Qu, S
Publicado em: (2011)