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

IPLSL and IPLSQ: Two types of imputation PLS algorithms for hierarchical latent variable model

Author

Listed:
  • Hao Cheng

Abstract

In many applications of hierarchical latent variable model, manifest variables could be missing due to various reasons. Improper missing data techniques or data imputation algorithms may lead to incredible data sets and inaccurate estimates. In our paper, we propose two types of imputation partial least square (PLS) algorithms to deal with missing data problems in hierarchical latent variable model. One is the imputation PLS algorithms based on linear regression (IPLSL), the other is the imputation PLS algorithms based on quantile regression (IPLSQ). In IPLSL, we apply the idea of complete case analysis (CC), inverse probability weighting (IPW) and fractional imputation (FI) to one kind of PLS algorithm which is different from the existing repeated indicators approach, two-step approach and hybrid approach. In IPLSQ, we also apply CC, IPW and FI to a modified PLS algorithm based on quantile regression. Compared with IPLSL, IPLSQ has the advantages in capturing overall view of structural relationships at different quantiles and highlighting the changing relations according to the explored quantile of interest. Together with mean and median imputation, we investigate the performances of our IPLSL and IPLSQ algorithms through simulation studies and then apply them to national science and technology innovation capability study based on part of World Bank database and Global Innovation Index report.

Suggested Citation

  • Hao Cheng, 2023. "IPLSL and IPLSQ: Two types of imputation PLS algorithms for hierarchical latent variable model," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(8), pages 2493-2513, April.
  • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:8:p:2493-2513
    DOI: 10.1080/03610926.2021.1955382
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2021.1955382?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:52:y:2023:i:8:p:2493-2513. 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.