Model-Based Co-Clustering for Censored Data
Abstract
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.
Related
- Locally Estimated Scatterplot Smoothing for Censored Survival Data
- SMOOTH DIVERGENCES ESTIMATION FOR CENSORED SURVIVAL DATA
- Two-level Factorial Life Testing with Type-II Censored Data
- R-estimation with right-censored data.
- Mixture of Censored Partially Linear Experts Models for Symmetric or Asymmetric Data with or without Outlying Observations: A novel approach with two-piece scale-mixture of normal distributions
BibTeX
@misc{fang2026modelbased,
title = {{Model-Based Co-Clustering for Censored Data}},
author = {Kejun Fang and Mincen Liu and Qihuang Zhang},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.01253},
eprint = {2611.01253},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.01253},
}
RIS
TY - UNPB
TI - Model-Based Co-Clustering for Censored Data
AU - Kejun Fang
AU - Mincen Liu
AU - Qihuang Zhang
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.01253
UR - https://arxiv.org/abs/2611.01253
AB - 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.
ER -