IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v37y2022i4d10.1007_s00180-021-01183-3.html
   My bibliography  Save this article

RMSE-minimizing confidence intervals for the binomial parameter

Author

Listed:
  • Kexin Feng

    (William & Mary)

  • Lawrence M. Leemis

    (William & Mary)

  • Heather Sasinowska

    (William & Mary)

Abstract

Let X be the number of successes in n mutually independent and identically distributed Bernoulli trials, each with probability of success p. For fixed n and $$\alpha $$ α , there are $$n + 1$$ n + 1 distinct two-sided $$100(1 - \alpha )$$ 100 ( 1 - α ) % confidence intervals for p associated with the outcomes $${X = 0, 1, 2, \ldots , n}$$ X = 0 , 1 , 2 , … , n . There is no known exact non-randomized confidence interval for p. Existing approximate confidence interval procedures use a formula, which often requires numerical methods to implement, to calculate confidence interval bounds. The bounds associated with these confidence intervals correspond to discontinuities in the actual coverage function. The paper does not aim to provide a formula for the confidence interval bounds, but rather to select the confidence interval bounds that minimize the root mean square error of the actual coverage function for sample size n and significance level $$\alpha $$ α in the frequentist context.

Suggested Citation

  • Kexin Feng & Lawrence M. Leemis & Heather Sasinowska, 2022. "RMSE-minimizing confidence intervals for the binomial parameter," Computational Statistics, Springer, vol. 37(4), pages 1855-1885, September.
  • Handle: RePEc:spr:compst:v:37:y:2022:i:4:d:10.1007_s00180-021-01183-3
    DOI: 10.1007/s00180-021-01183-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-021-01183-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00180-021-01183-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:compst:v:37:y:2022:i:4:d:10.1007_s00180-021-01183-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.