IDEAS home Printed from https://ideas.repec.org/a/spr/testjl/v34y2025i2d10.1007_s11749-025-00967-9.html
   My bibliography  Save this article

Flexible clustering via Gaussian parsimonious mixture models with censored and missing values

Author

Listed:
  • Wan-Lun Wang

    (National Cheng Kung University)

  • Victor Hugo Lachos

    (University of Connecticut)

  • Yu-Chien Chen

    (National Chung Hsing University)

  • Tsung-I Lin

    (National Chung Hsing University
    China Medical University)

Abstract

The Gaussian mixture model (GMM) is a versatile and widely used tool for model-based clustering and classification of multivariate data with heterogeneity. While there are existing software packages designed to fit the GMM with varying numbers of mixture components and covariance structures, they are inapplicable when dealing with data containing both censored and missing values. This paper addresses this limitation by proposing an extended framework of the GMM, called the GPMM-CM, which incorporates 14 specifications of parsimonious component–covariance matrices to accommodate the complex situation of existing censored and missing values. Under the missing at random mechanism, an analytically feasible expectation conditional maximization algorithm is devised for carrying out maximum likelihood estimation of the GPMM-CM approach. The superiority and utility of the proposed methodology are demonstrated through analyses of both real and simulated datasets.

Suggested Citation

  • Wan-Lun Wang & Victor Hugo Lachos & Yu-Chien Chen & Tsung-I Lin, 2025. "Flexible clustering via Gaussian parsimonious mixture models with censored and missing values," TEST: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 34(2), pages 431-458, June.
  • Handle: RePEc:spr:testjl:v:34:y:2025:i:2:d:10.1007_s11749-025-00967-9
    DOI: 10.1007/s11749-025-00967-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11749-025-00967-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11749-025-00967-9?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.

    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:spr:testjl:v:34:y:2025:i:2:d:10.1007_s11749-025-00967-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.