Approximate learning of parsimonious Bayesian context trees

DOI10.1007/S11222-026-10835-7MaRDI QIDQ6834585zbMATH OpenFDO

Authors Daniyar Ghani, Nicholas A. Heard, Francesco Sanna Passino

Publication date 31 March 2026

Published in Statistics and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11222-026-10835-7

zbMATH Keywords

categorical sequencescontext treesMarkov modelsmodel-based clustering

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites work

• A Bayesian analysis of some nonparametric problems
• A Quantitative Study of Gene Regulation Involved in the Immune Response of Anopheline Mosquitoes
• A universal data compression system
• Algorithms for learning parsimonious context trees
• Bayesian context trees: modelling and exact inference for discrete time series
• Bayesian MAP model selection of chain event graphs
• Chain event graphs
• Conditional independence and chain event graphs
• Fitting sparse Markov models through a collapsed Gibbs sampler
• scientific article; zbMATH DE number 3896009 (Why is no real title available?)
• scientific article; zbMATH DE number 3942813 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 2243374 (Why is no real title available?)
• Nested Dirichlet models for unsupervised attack pattern detection in honeypot data
• Posterior representations for Bayesian context trees: sampling, estimation and convergence
• Sparse Markov chains for sequence data

This page was built for publication: Approximate learning of parsimonious Bayesian context trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834585)