首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Sparse cluster analysis of large-scale discrete variables with application to single nucleotide polymorphism data
Authors:Baolin  Wu
Institution:Division of Biostatistics, School of Public Health , University of Minnesota , Minneapolis , MN , 55455 , USA
Abstract:Currently, extreme large-scale genetic data present significant challenges for cluster analysis. Most of the existing clustering methods are typically built on the Euclidean distance and geared toward analyzing continuous response. They work well for clustering, e.g. microarray gene expression data, but often perform poorly for clustering, e.g. large-scale single nucleotide polymorphism (SNP) data. In this paper, we study the penalized latent class model for clustering extremely large-scale discrete data. The penalized latent class model takes into account the discrete nature of the response using appropriate generalized linear models and adopts the lasso penalized likelihood approach for simultaneous model estimation and selection of important covariates. We develop very efficient numerical algorithms for model estimation based on the iterative coordinate descent approach and further develop the expectation–maximization algorithm to incorporate and model missing values. We use simulation studies and applications to the international HapMap SNP data to illustrate the competitive performance of the penalized latent class model.
Keywords:clustering  expectation–maximization algorithm  latent class model  lasso  k-means  principal components  single nucleotide polymorphism  sparse clustering
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号