Skip to main navigation Skip to search Skip to main content

Sparse Bayesian hierarchical modeling of high-dimensional clustering problems

  • Heng Lian*
  • *Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

Clustering is one of the most widely used procedures in the analysis of microarray data, for example with the goal of discovering cancer subtypes based on observed heterogeneity of genetic marks between different tissues. It is well known that in such high-dimensional settings, the existence of many noise variables can overwhelm the few signals embedded in the high-dimensional space. We propose a novel Bayesian approach based on Dirichlet process with a sparsity prior that simultaneous performs variable selection and clustering, and also discover variables that only distinguish a subset of the cluster components. Unlike previous Bayesian formulations, we use Dirichlet process (DP) for both clustering of samples as well as for regularizing the high-dimensional mean/variance structure. To solve the computational challenge brought by this double usage of DP, we propose to make use of a sequential sampling scheme embedded within Markov chain Monte Carlo (MCMC) updates to improve the naive implementation of existing algorithms for DP mixture models. Our method is demonstrated on a simulation study and illustrated with the leukemia gene expression dataset. © 2010 Elsevier Inc.
Original languageEnglish
Pages (from-to)1728-1737
JournalJournal of Multivariate Analysis
Volume101
Issue number7
DOIs
Publication statusPublished - Aug 2010
Externally publishedYes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

  1. SDG 3 - Good Health and Well-being
    SDG 3 Good Health and Well-being

Research Keywords

  • Dirichlet process
  • Markov chain Monte Carlo
  • Sequential sampling
  • Sparsity prior

Fingerprint

Dive into the research topics of 'Sparse Bayesian hierarchical modeling of high-dimensional clustering problems'. Together they form a unique fingerprint.

Cite this