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

Adaptive cluster sampling based on balanced sampling plan excluding contiguous units

Author

Listed:
  • Neeraj Tiwari
  • Jharna Banerjie
  • Girish Chandra
  • Shailja Bhari

Abstract

The method of adaptive cluster sampling (ACS) is useful for the surveys when the characteristic of interest is sparsely distributed but highly aggregated. In ACS, the initial sample is selected by simple random sampling (SRS). The final sample is obtained by adapting the nearby units which satisfy the pre-specified condition. This sampling can further be improved when the appropriate control is imposed to select the initial sample. In this article, Balanced Sampling plan Excluding Contiguous units (BSEC plan) has been used to select the initial sample for estimating population mean in ACS. The purpose is to ignore non preferred or contiguous units and include more preferred units in the final sample. The unbiased estimators of population mean based on the initial sample and modified Hansen-Hurwitz (HH) type estimators are discussed. It has been illustrated theoretically and empirically that the modified HH type estimator based on BSEC plan is more precise than that based on SRS. The proposed method provides the opportunity to select the non contiguous units in initial sample, which makes the design more informative and efficient in comparison to ACS. The proposed design may be helpful in improving the ACS estimates in many real-life situations.

Suggested Citation

  • Neeraj Tiwari & Jharna Banerjie & Girish Chandra & Shailja Bhari, 2024. "Adaptive cluster sampling based on balanced sampling plan excluding contiguous units," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(15), pages 5364-5377, August.
  • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:15:p:5364-5377
    DOI: 10.1080/03610926.2023.2220448
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2023.2220448?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:53:y:2024:i:15:p:5364-5377. 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.