Hidden Markov Models on Variable Blocks with a Modal Clustering Algorithm and Applications

2016/06/28 by Lin, Lin, Li, Jia
#FOS: Computer and information sciences #Methodology (stat.ME)

paper · doi:10.48550/arxiv.1606.08903

Abstract

Motivated by high-throughput single-cell cytometry data with applications to vaccine development and immunological research, we consider statistical clustering in large-scale data that contain multiple rare clusters. We propose a new hierarchical mixture model, namely Hidden Markov Model on Variable Blocks (HMM-VB), and a new mode search algorithm called Modal Baum-Welch (MBW) for efficient clustering. Exploiting the widely accepted chain-like dependence among groups of variables in the cytometry data, we propose to treat the hierarchy of variable groups as a figurative time line and employ a HMM-type model, namely HMM-VB. We also propose to use mode-based clustering, aka modal clustering, and overcome the exponential computational complexity by MBW. In a series of experiments on simulated data HMM-VB and MBW have better performance than existing methods. We also apply our method to identify rare cell subsets in cytometry data and examine its strengths and limitations.

Related

• Tech Report A Variational HEM Algorithm for Clustering Hidden Markov Models
• Clustering hidden Markov models with variational HEM
• High-dimensional variable clustering based on maxima of a weakly dependent random process
• A Bayesian hierarchical hidden Markov model for clustering and gene selection: Application to kidney cancer gene expression data
• Gene Expression Time Course Clustering with Countably Infinite Hidden Markov Models