IDEAS home Printed from https://ideas.repec.org/a/taf/japsta/v41y2014i10p2141-2156.html
   My bibliography  Save this article

Mixed ranked set sampling design

Author

Listed:
  • Abdul Haq
  • Jennifer Brown
  • Elena Moltchanova
  • Amer Ibrahim Al-Omari

Abstract

The main focus of agricultural, ecological and environmental studies is to develop well designed, cost-effective and efficient sampling designs. Ranked set sampling (RSS) is one method that leads to accomplish such objectives by incorporating expert knowledge to its advantage. In this paper, we propose an efficient sampling scheme, named mixed RSS (MxRSS), for estimation of the population mean and median. The MxRSS scheme is a suitable mixture of both simple random sampling (SRS) and RSS schemes. The MxRSS scheme provides an unbiased estimator of the population mean, and its variance is always less than the variance of sample mean based on SRS. For both symmetric and asymmetric populations, the mean and median estimators based on SRS, partial RSS (PRSS) and MxRSS schemes are compared. It turns out that the mean and median estimates under MxRSS scheme are more precise than those based on SRS scheme. Moreover, when estimating the mean of symmetric and some asymmetric populations, the mean estimates under MxRSS scheme are found to be more efficient than the mean estimates with PRSS scheme. An application to real data is also provided to illustrate the implementation of the proposed sampling scheme.

Suggested Citation

  • Abdul Haq & Jennifer Brown & Elena Moltchanova & Amer Ibrahim Al-Omari, 2014. "Mixed ranked set sampling design," Journal of Applied Statistics, Taylor & Francis Journals, vol. 41(10), pages 2141-2156, October.
  • Handle: RePEc:taf:japsta:v:41:y:2014:i:10:p:2141-2156
    DOI: 10.1080/02664763.2014.909781
    as

    Download full text from publisher

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

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hamid Rahmani & Mostafa Razmkhah, 2017. "Perfect ranking test in moving extreme ranked set sampling," Statistical Papers, Springer, vol. 58(3), pages 855-875, September.

    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:japsta:v:41:y:2014:i:10:p:2141-2156. 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/CJAS20 .

    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.