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

A robust high dimensional estimation of a finite mixture of the generalized linear model

Author

Listed:
  • Azam Sabbaghi
  • Farzad Eskandari

Abstract

Robust high dimensional estimation is one of the most important problems in statistics. In a high dimensional structure with a small number of non-zero observations, the dimension of the parameters is larger than the sample size. For modeling the sparsity of outlier response vector, we randomly selected a small number of observations and corrupted them arbitrarily. There are two distinct ways to overcome sparsity in the generalized linear model (GLM): in the parameter space, or in the space output. According to several studies in corrupted observation modeling, there is a relationship between robustness and sparsity. In this paper for obtaining robust high dimensional estimation, we proposed a finite mixture of the generalized linear models (FMGLMs). By using simulation with the expectation-maximization (EM) algorithm, we show improved modeling performance.

Suggested Citation

  • Azam Sabbaghi & Farzad Eskandari, 2022. "A robust high dimensional estimation of a finite mixture of the generalized linear model," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(13), pages 4451-4463, June.
  • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:13:p:4451-4463
    DOI: 10.1080/03610926.2020.1815780
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2020.1815780?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:51:y:2022:i:13:p:4451-4463. 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.