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

Robust inference in the multilevel zero-inflated negative binomial model

Author

Listed:
  • Eghbal Zandkarimi
  • Abbas Moghimbeigi
  • Hossein Mahjub
  • Reza Majdzadeh

Abstract

A popular way to model correlated count data with excess zeros and over-dispersion simultaneously is by means of the multilevel zero-inflated negative binomial (MZINB) distribution. Due to the complexity of the likelihood of these models, numerical methods such as the EM algorithm are used to estimate parameters. On the other hand, in the presence of outliers or when mixture components are poorly separated, the likelihood-based methods can become unstable. To overcome this challenge, we extend the robust expectation-solution (RES) approach for building a robust estimator of the regression parameters in the MZINB model. This approach achieves robustness by applying robust estimating equations in the S-step instead of estimating equations in the M-step of the EM algorithm. The robust estimation equation in the logistic component only weighs the design matrix (X) and reduces the effect of the leverage points, but in the negative binomial component, the influence of deviations on the response (Y) and design matrix (X) are bound separately. Simulation studies under various settings show that the RES algorithm gives us consistent estimates with smaller biases than the EM algorithm under contaminations. The RES algorithm applies to the data of the DMFT index and the fertility rate data.

Suggested Citation

  • Eghbal Zandkarimi & Abbas Moghimbeigi & Hossein Mahjub & Reza Majdzadeh, 2020. "Robust inference in the multilevel zero-inflated negative binomial model," Journal of Applied Statistics, Taylor & Francis Journals, vol. 47(2), pages 287-305, January.
  • Handle: RePEc:taf:japsta:v:47:y:2020:i:2:p:287-305
    DOI: 10.1080/02664763.2019.1636942
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/02664763.2019.1636942?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:japsta:v:47:y:2020:i:2:p:287-305. 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.