A sparse negative binomial mixture model for clustering RNA-seq count data
Clustering with variable selection is a challenging yet critical task for modern small-n-large-p data. Existing methods based on sparse Gaussian mixture models or sparse K-means provide solutions to continuous data. With the prevalence of RNA-seq technology and lack of count data modeling for clustering, the current practice is to normalize count expression data into continuous measures and apply existing models with Gaussian assumption. In this paper, we develop a negative binomial mixture model with lasso or fused lasso gene regularization to cluster samples (small n) with high-dimensional gene features (large p). EM algorithm and Bayesian information criterion are used for inference and determining tuning parameters. The method is compared with existing methods using extensive simulations and two real transcriptomic applications in rat brain and breast cancer studies. The result shows superior performance of the proposed count data model in clustering accuracy, feature selection and biological interpretation in pathways.
Code (1)
Tasks
Clusteringfeature selectionVariable SelectionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Generalized Negative Binomial Processes and the Representation of Cluster Structures
The paper introduces the concept of a cluster structure to define a joint distribution of the sample size and its exchangeable random partitions. The cluster structure allows the probability distribution of the random pa…
ClusteringFully Bayesian inference for neural models with negative-binomial spiking
Characterizing the information carried by neural populations in the brain requires accurate statistical models of neural spike responses. The negative-binomial distribution provides a convenient model for over-dispersed…
Bayesian InferenceData AugmentationregressionOptimal Clustering of Discrete Mixtures: Binomial, Poisson, Block Models, and Multi-layer Networks
In this paper, we first study the fundamental limit of clustering networks when a multi-layer network is present. Under the mixture multi-layer stochastic block model (MMSBM), we show that the minimax optimal network clu…
ClusteringCommunity DetectionStochastic Block ModelVariable subset selection via GA and information complexity in mixtures of Poisson and negative binomial regression models
Count data, for example the number of observed cases of a disease in a city, often arise in the fields of healthcare analytics and epidemiology. In this paper, we consider performing regression on multivariate data in wh…
EpidemiologyregressionUniversal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models
Clustering is a pivotal challenge in unsupervised machine learning and is often investigated through the lens of mixture models. The optimal error rate for recovering cluster labels in Gaussian and sub-Gaussian mixture m…
Clustering