Scalable Bayesian Nonparametric Clustering and Classification
arXiv:1806.02670
Abstract
We develop a scalable multi-step Monte Carlo algorithm for inference under a large class of nonparametric Bayesian models for clustering and classification. Each step is "embarrassingly parallel" and can be implemented using the same Markov chain Monte Carlo sampler. The simplicity and generality of our approach makes inference for a wide range of Bayesian nonparametric mixture models applicable to large datasets. Specifically, we apply the approach to inference under a product partition model with regression on covariates. We show results for inference with two motivating data sets: a large set of electronic health records (EHR) and a bank telemarketing dataset. We find interesting clusters and favorable classification performance relative to other widely used competing classifiers.
arXiv comment29 pages, 3 figures, 2 tables
References in corpus (8)
- Quantum support vector machine for big data classification
- MMD GAN: Towards Deeper Understanding of Moment Matching Network
- Generating Multi-label Discrete Patient Records using Generative Adversarial Networks
- Are Gibbs-type priors the most natural generalization of the Dirichlet process?
- Austerity in MCMC Land: Cutting the Metropolis-Hastings Budget
- On Markov chain Monte Carlo methods for tall data
- MCMC for Normalized Random Measure Mixture Models
- Parallelizing MCMC via Weierstrass Sampler