{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:37Z","timestamp":1773376597272,"version":"3.50.1"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206850","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2470-2475","source":"Crossref","is-referenced-by-count":0,"title":["Time Series Analysis with Bayesian Context Trees: Classical Asymptotics and Finite-n Bounds"],"prefix":"10.1109","author":[{"given":"Ioannis","family":"Kontoyiannis","sequence":"first","affiliation":[{"name":"University of Cambridge"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4076(91)90012-3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.661523"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1198\/1061860043524"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.382011"},{"key":"ref15","article-title":"Faster universal modeling for two source classes","author":"nowbakht","year":"2002","journal-title":"23rd Symp Information Theory in the Benelux"},{"key":"ref37","article-title":"Context tree weighting: Basic properties","author":"willems","year":"1993"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref36","article-title":"Maximum aposteriori probability tree models","author":"willems","year":"2002","journal-title":"4th International ITG Conference on Source and Channel Coding"},{"key":"ref31","article-title":"Multi-alphabet universal coding using a binary decomposition context tree weighting algorithm","author":"tjalkens","year":"1994","journal-title":"Symposium on Information Theory in the Benelux"},{"key":"ref30","first-page":"230","article-title":"Sequential weighting algorithms for multi-alphabet sources","author":"tjalkens","year":"1993","journal-title":"6th Joint Swedish-Russian International Workshop on Information Theory"},{"key":"ref11","article-title":"Change-point detection and segmentation of discrete data using Bayesian context trees","author":"lungu","year":"2022"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.312161"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965823"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1995.531122"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/lnms\/1215540964"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg489"},{"key":"ref17","article-title":"Bayesian mixture models for time series based on context trees","author":"papageorgiou","year":"2022","journal-title":"36th International Workshop on Statistical Modelling"},{"key":"ref39","article-title":"Context tree weighting: Redundancy bounds and optimality","author":"willems","year":"1993","journal-title":"6th Joint Swedish-Russian International Workshop on Information Theory"},{"key":"ref16","article-title":"Hierarchical Bayesian mixture models for time series using context trees as state space partitions","author":"papageorgiou","year":"2021","journal-title":"ArXiv e-prints"},{"key":"ref38","article-title":"Context tree weighting: Multi-alphabet sources","author":"willems","year":"1993","journal-title":"Symposium on Information Theory in the Benelux"},{"key":"ref19","article-title":"Posterior representations for Bayesian Context Trees: Sampling, estimation and convergence","author":"papageorgiou","year":"2022","journal-title":"ArXiv e-prints"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834791"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350051"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057210"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"ref25","author":"rissanen","year":"1989","journal-title":"Stochastic Complexity in Statistical Inquiry"},{"key":"ref20","article-title":"BCT: Bayesian Context Trees for discrete time series","author":"papageorgiou","year":"2022"},{"key":"ref42","article-title":"Context tree maximizing","author":"willems","year":"2000","journal-title":"2000 Conference on Information Sciences and Systems"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.532891"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056936"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056741"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970825"},{"key":"ref27","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtar\u2019kov","year":"1987","journal-title":"Probl Peredachi Inf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2219171"},{"key":"ref8","article-title":"Context-tree weighting and Bayesian Context Trees: Asymptotic and non-asymptotic justifications","author":"kontoyiannis","year":"2022"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2307\/1267787"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12511"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.830765"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/2291091"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2267934"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206850.pdf?arnumber=10206850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:47Z","timestamp":1773347207000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206850\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206850","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}