Graphical posterior predictive classification: Bayesian model averaging with particle Gibbs
From MaRDI portal
Publication:6050282
DOI10.1090/tpms/1198arXiv1707.06792OpenAlexW4387301877MaRDI QIDQ6050282
Tatjana Pavlenko, Felix L. Rios
Publication date: 12 October 2023
Published in: Theory of Probability and Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.06792
Statistics (62-XX) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Artificial intelligence (68Txx) Theory of computing (68Qxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simultaneous predictive Gaussian classifiers
- Have I seen you before? Principles of Bayesian predictive classification revisited
- Counting labelled chordal graphs
- Conjugate Bayes discrimination with infinitely many variables
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Model uncertainty
- Sequential sampling of junction trees for decomposable graphs
- Bayesian learning of weakly structural Markov graph laws using sequential Monte Carlo methods
- Marginal and simultaneous predictive classification using stratified graphical models
- Structural Markov graph laws for Bayesian model uncertainty
- On particle Gibbs sampling
- Bayesian Block-Diagonal Predictive Classifier for Gaussian Data
- Inductive Inference and Partition Exchangeability in Classification
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- Particle Markov Chain Monte Carlo Methods
- Bayes Factors
- Bayesian Graphical Models for Discrete Data
- A structural Markov property for decomposable graph laws that allows control of clique intersections
- Sampling decomposable graphs using a Markov chain on junction trees
