Metraipolis › archive › dc_df267344f35d

Model-Based Co-Clustering for Censored Data — arXiv:2611.01253

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01253
License (as archived)
CC0-1.0
Archived
2026-11-03T18:43:35.756Z
SHA-256 of the archived text
b1175e49badfff9c10d7ac807ffaf7ebde4d66ccd1b639488a014a4a3f1339fe
Stable URL of this page
https://metraipolis.com/documento/dc_df267344f35d

How to cite

Model-Based Co-Clustering for Censored Data — arXiv:2611.01253 — arXiv (en), https://arxiv.org/abs/2611.01253 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df267344f35d (Metraipolis archive dc_df267344f35d, sha256 b1175e49badfff9c10d7ac807ffaf7ebde4d66ccd1b639488a014a4a3f1339fe)
BibTeX
@misc{dcdf267344f35d,
  title = {Model-Based Co-Clustering for Censored Data — arXiv:2611.01253},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01253},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df267344f35d; sha256 b1175e49badfff9c10d7ac807ffaf7ebde4d66ccd1b639488a014a4a3f1339fe},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01253. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Co-clustering jointly partitions the rows and columns of a data matrix. Standard co-clustering methods for continuous data typically assume that entries are observed exactly. Matrices with censored entries, such as assay measurements below a detection limit, are therefore commonly completed by substitution or imputation before co-clustering. Since the completed values are treated as exact, the estimated block means and partitions depend on the completion rule. We propose the censored Gaussian latent block model (CGLBM), in which each censored entry contributes the probability of its reported interval. We establish identifiability under a known Type I censoring design. Approximate standard errors for the block means follow from the Fisher information under censoring. CGLBM is fitted by a generalized expectation--maximization algorithm, and its row and column class numbers are selected by a BIC approximation to the integrated classification likelihood. In simulation studies, boundary substitution and truncated normal imputation attenuate the contrasts between block means, whereas the partition recovery of multiple imputation drops the most under heavy censoring. CGLBM preserves the contrasts, and its partition recovery drops the least. The method is implemented in the R package CGLBM.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno).
Categorie arXiv: Methodology (stat.ME) ; Computation (stat.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01253 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:13:53.108Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).