IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v47y2018i13p3043-3051.html
   My bibliography  Save this article

Finding confidence bound using two-stage data

Author

Listed:
  • Debashis Kushary

Abstract

Multistage sampling schemes for statistical inference are widespread. In particular, computing one or two sided confidence limits from two-stage samples has many applications. Typically, in a two stage sampling scheme, at the end of the first stage, the investigator carries out a statistical testing procedure to decide whether to move on to the second stage or to stop sampling. If the investigator decides to go to the second stage, then more samples are taken and a final decision is reached. Since the cost of sampling is sometimes very high, it is desired to use all the samples from both the stages to make a terminal decision. Bias considerations usually make it improper to simply combine the samples and treat them as one sample. In this paper, we consider computing confidence bounds for a mean using data from two stages. Let n1 sample points be taken in the first stage and a standard level-α t-test performed for testing the hypothesis H0:μ≤μovs.H1:μ>μo.$H_0: \mu \le \mu _o \ \text{vs.} \ H_1: \mu > \mu _o.$ If H0 is rejected, then a second sample of size n2 is taken. Now the goal is to compute a lower confidence bound for the true mean μ using all (n1 + n2) sample points. Here we propose three different methods to compute the lower confidence bound using bootstrap methodology. The procedures differ in their demands of computational power which is reflected in their accuracy of coverage probability. Performance of the procedures is evaluated by simulation. It is noteworthy that in almost all the research mentioned above, the values of n1 and n2 considered are relatively small. Hence we focus on small sample behavior of two stage confidence bound.

Suggested Citation

  • Debashis Kushary, 2018. "Finding confidence bound using two-stage data," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 47(13), pages 3043-3051, July.
  • Handle: RePEc:taf:lstaxx:v:47:y:2018:i:13:p:3043-3051
    DOI: 10.1080/03610926.2015.1062110
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2015.1062110
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2015.1062110?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:47:y:2018:i:13:p:3043-3051. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.