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

Compromised imputation based mean estimators using robust quantile regression

Author

Listed:
  • Malik Muhammad Anas
  • Zhensheng Huang
  • Usman Shahzad
  • Tolga Zaman
  • Shabnam Shahzadi

Abstract

Missing information is a typical issue in sampling surveys. The analysts have perceived that statistical inference possibly ruined due to occurrence of non-response. Ratio type regression estimators under simple random sampling (SRS) scheme for estimating the population mean are commonly used when some of the data suffered with the issue of missingness. It is worth noting that this class is based on ordinary least square regression coefficient which is not suitable when extreme values present in the data set. In this research, primarily a modified class of estimators is presented by adapting the idea of Zaman and Bulut. Later on, a class of quantile regression type estimators is defined which is an effective technique in presence of extreme observations. The utilization of quantile regression in the idea of Zaman and Bulut’s work empowered the proposed class of estimators for the estimation of population mean especially for missingness in the data. For mean square error (MSE), the hypothetical equations are also formulated for adapted and proposed estimators, on the basis of three possible cases of missingness. To justify the proposed work these hypothetical innovations are illustrated by the numerical demonstrations.

Suggested Citation

  • Malik Muhammad Anas & Zhensheng Huang & Usman Shahzad & Tolga Zaman & Shabnam Shahzadi, 2022. "Compromised imputation based mean estimators using robust quantile regression," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(5), pages 1700-1715, August.
  • Handle: RePEc:taf:lstaxx:v:53:y:2022:i:5:p:1700-1715
    DOI: 10.1080/03610926.2022.2108057
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2022.2108057?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:2022:i:5:p:1700-1715. 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.