Bayesian nonparametric clustering for large data sets

We propose two nonparametric Bayesian methods to cluster big data and apply them to cluster genes by patterns of gene–gene interaction. Both approaches define model-based clustering with nonparametric Bayesian priors and include an implementation that remains feasible for big data. The first method is based on a predictive recursion which requires a single cycle (or few cycles) of simple deterministic calculations for each observation under study. The second scheme is an exact method that divides the data into smaller subsamples and involves local partitions that can be determined in parallel. In a second step, the method requires only the sufficient statistics of each of these local clusters to derive global clusters. Under simulated and benchmark data sets the proposed methods compare favorably with other clustering algorithms, including k-means, DP-means, DBSCAN, SUGS, streaming variational Bayes and an EM algorithm. We apply the proposed approaches to cluster a large data set of gene–gene interactions extracted from the online search tool “Zodiac.”

     

A Bayesian hierarchical model for inference across related reverse phase protein arrays experiments

We consider inference for functional proteomics experiments that record protein activation over time following perturbation under different dose levels of several drugs. The main inference goal is the dependence structure of the selected proteins. A critical challenge is the lack of sufficient data under any one drug and dose level to allow meaningful inference on dependence structure. We propose a hierarchical model to implement the desired inference. The key element of the model is a shared dependence structure on (latent) binary indicators of protein activation.