z-logo
Premium
Confidence intervals based on some weighting functions for the difference of two binomial proportions
Author(s) -
Maruo Kazushi,
Kawai Norisuke
Publication year - 2014
Publication title -
statistics in medicine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.996
H-Index - 183
eISSN - 1097-0258
pISSN - 0277-6715
DOI - 10.1002/sim.6147
Subject(s) - confidence interval , statistics , weighting , mathematics , cdf based nonparametric confidence interval , coverage probability , binomial (polynomial) , nominal level , exact statistics , sample size determination , binomial proportion confidence interval , robust confidence intervals , value (mathematics) , negative binomial distribution , poisson distribution , medicine , radiology
In this paper, we propose two new methods for computing confidence intervals for the difference of two independent binomial proportions in small sample cases. Several test‐based exact confidence intervals have been developed to guarantee the nominal coverage probability in small sample cases. However, these methods are sometimes unnecessarily too conservative because they use the exact p ‐value for constructing confidence intervals by maximizing the tail probability to account for the worst configuration. In order to reduce conservatism, our new methods adopt the p ‐value weighted by two types of functions instead of the maximum p ‐value. Our proposed methods can be regarded as quasi‐exact methods. The performance evaluation results showed that our methods are much less conservative than the exact method. Compared with other existing quasi‐exact methods, generally, our methods possess coverage probabilities closer to the nominal confidence level and shorter expected confidence widths. In particular, the beta weighing method provides the most reasonable balance between accurate coverage probability and short interval width in small sample cases. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here