{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:26Z","timestamp":1773377966039,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518189","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2906-2911","source":"Crossref","is-referenced-by-count":10,"title":["Revisiting Context-Tree Weighting for Bayesian Inference"],"prefix":"10.1109","author":[{"given":"I.","family":"Papageorgiou","sequence":"first","affiliation":[{"name":"U. of Cambridge"}]},{"given":"I.","family":"Kontoyiannis","sequence":"additional","affiliation":[{"name":"U. of Cambridge"}]},{"given":"L.","family":"Mertzanis","sequence":"additional","affiliation":[{"name":"U. of Maryland"}]},{"given":"A.","family":"Panotopoulou","sequence":"additional","affiliation":[{"name":"Dartmouth College"}]},{"given":"M.","family":"Skoularidou","sequence":"additional","affiliation":[{"name":"U. of Cambridge"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/15-BA949"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/sjos.12053"},{"key":"ref11","article-title":"Bayesian Context Trees: Modelling and exact inference for discrete time series","author":"kontoyiannis","year":"2020","journal-title":"ArXiv e-prints"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2018.8445994"},{"key":"ref13","article-title":"BCT: Bayesian Context Trees for discrete time series","author":"papageorgiou","year":"2020","journal-title":"R Package Version 1 54 1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007670818503"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1985.tb01383.x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2307\/2986120"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056741"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346150"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1987.tb01694.x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.382012"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1214\/aos\/1018031204","article-title":"Variable length Markov chains","volume":"27","author":"b\u00fchlmann","year":"1999","journal-title":"Ann Statist"},{"key":"ref27","article-title":"Maximum a-posteriori probability tree models","author":"willems","year":"2002","journal-title":"4th International ITG Conference on Source and Channel Coding"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866316"},{"key":"ref29","article-title":"Context maximizing: Finding MDL decision trees","author":"willems","year":"1994","journal-title":"Symposium on Information Theory in the Benelux"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/lnms\/1215540964"},{"key":"ref8","author":"gelman","year":"2014","journal-title":"Bayesian Data Analysis"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/entropy-e10020071"},{"key":"ref2","first-page":"5","article-title":"Modélisation autorégressive des chaînes de Markov: Utilisation d'une matrice différente pour chaque retard","volume":"44","author":"berchtold","year":"1996","journal-title":"Revue de Statistique Appliquée"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1491"},{"key":"ref20","author":"rissanen","year":"1989","journal-title":"Stochastic Complexity in Statistical Inquiry"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026490906255"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4145-2"},{"key":"ref24","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":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2015.1115763"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2013.40"},{"key":"ref25","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"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518189.pdf?arnumber=9518189","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:42Z","timestamp":1773347742000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518189\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518189","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}