Confidence intervals for multinomial logistic regression in sparse data

被引:42
|
作者
Bull, Shelley B.
Lewinger, Juan Pablo
Lee, Sophia S. F.
机构
[1] Mt Sinai Hosp, Samuel Lunenfeld Res Inst, Prosserman Ctr Hlth Res, Toronto, ON M5G 1X5, Canada
[2] Univ Toronto, Dept Publ Hlth Sci, Toronto, ON, Canada
[3] Univ Toronto, Dept Stat, Toronto, ON, Canada
基金
加拿大健康研究院;
关键词
asymptotic bias; Bayesian estimates; bias reduction; continuous covariate; data separation; infinite estimates; Jeffreys prior; odds ratio; polychotomous logistic regression; polytomous logistic regression; small samples;
D O I
10.1002/sim.2518
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Logistic regression is one of the most widely used regression models in practice, but alternatives to conventional maximum likelihood estimation methods may be more appropriate for small or sparse samples. Modification of the logistic regression score function to remove first-order bias is equivalent to penalizing the likelihood by the Jeffreys prior, and yields penalized maximum likelihood estimates (PLEs) that always exist, even in samples in which maximum likelihood estimates (MLEs) are infinite. PLEs are an attractive alternative in small-to-moderate-sized samples, and are preferred to exact conditional MLEs when there are continuous covariates. We present methods to construct confidence intervals (CI) in the penalized multinomial logistic regression model, and compare Cl coverage and length for the PLE-based methods to that of conventional MLE-based methods in trinomial logistic regressions with both binary and continuous covariates. Based on simulation studies in sparse data sets, we recommend profile CIs over asymptotic Wald-type intervals for the PLEs in all cases. Furthermore, when finite sample bias and data separation are likely to occur, we prefer PLE profile CIs over MLE methods. Copyright (c) 2006 John Wiley & Sons, Ltd.
引用
收藏
页码:903 / 918
页数:16
相关论文
共 50 条
  • [1] Fast sparse multinomial logistic regression and big data parallelism
    Zhang, Liping (zhanglp@cqupt.edu.cn), 1600, Universidad Central de Venezuela (55):
  • [2] Approximate Sparse Multinomial Logistic Regression for Classification
    Kayabol, Koray
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2020, 42 (02) : 490 - 493
  • [3] Distributed Parallel Sparse Multinomial Logistic Regression
    Lei, Dajiang
    Du, Meng
    Chen, Hao
    Li, Zhixing
    Wu, Yu
    IEEE ACCESS, 2019, 7 : 55496 - 55508
  • [4] Multiclass Classification by Sparse Multinomial Logistic Regression
    Abramovich, Felix
    Grinshtein, Vadim
    Levy, Tomer
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (07) : 4637 - 4646
  • [5] PIANO: A fast parallel iterative algorithm for multinomial and sparse multinomial logistic regression
    Jyothi, R.
    Babu, P.
    SIGNAL PROCESSING, 2022, 194
  • [6] SIMULTANEOUS PREDICTION INTERVALS FOR MULTINOMIAL LOGISTIC-REGRESSION MODELS
    SAMBAMOORTHI, N
    ERVIN, VJ
    THOMAS, G
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 1994, 23 (03) : 815 - 829
  • [7] Sparse multinomial logistic regression: Fast algorithms and generalization bounds
    Krishnapuram, B
    Carin, L
    Figueiredo, MAT
    Hartemink, AJ
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (06) : 957 - 968
  • [8] Incorporating Confidence Intervals on the Decision Threshold in Logistic Regression
    Kist, Michael J.
    Silvestrini, Rachel T.
    QUALITY AND RELIABILITY ENGINEERING INTERNATIONAL, 2016, 32 (05) : 1769 - 1784
  • [9] Sparse Multinomial Logistic Regression via Approximate Message Passing
    Byrne, Evan
    Schniter, Philip
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2016, 64 (21) : 5485 - 5498
  • [10] Confidence Intervals for Sparse Penalized Regression With Random Designs
    Yu, Guan
    Yin, Liang
    Lu, Shu
    Liu, Yufeng
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2020, 115 (530) : 794 - 809