Variational Bayesian Methods for a Tree-Structured Stick-Breaking Process Mixture of Gaussians

arXiv:2405.00385v1 Announce Type: cross
Abstract: The Bayes coding algorithm for context tree source is a successful example of Bayesian tree estimation in text compression in information theory. This algorithm provides an efficient parametric representation of the posterior tree distribution and exact updating of its parameters. We apply this algorithm to a clustering task in machine learning. More specifically, we apply it to Bayesian estimation of the tree-structured stick-breaking process (TS-SBP) mixture models. For TS-SBP mixture models, only Markov chain Monte …

abstract algorithm apply arxiv bayes bayesian breaking coding compression context cs.it cs.lg distribution example information math.it parameters parametric posterior process representation stat.ml text theory tree type