{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:56:40Z","timestamp":1772927800146,"version":"3.50.1"},"reference-count":19,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025tap0005","type":"journal-article","created":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T22:06:07Z","timestamp":1758665167000},"page":"524-537","source":"Crossref","is-referenced-by-count":0,"title":["Probability Distribution on Rooted Trees: Generalization from Full Trees"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Yuta","family":"NAKAHARA","sequence":"first","affiliation":[{"name":"Center for Data Science, Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shota","family":"SAITO","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Gunma University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"KAMATSUKA","sequence":"additional","affiliation":[{"name":"Department of Information Science, Shonan Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyasu","family":"MATSUSHIMA","sequence":"additional","affiliation":[{"name":"Department of Pure and Applied Mathematics, Waseda University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Y. Nakahara, S. Saito, A. Kamatsuka, and T. Matsushima, \u201cProbability distribution on rooted trees,\u201d 2022 IEEE International Symposium on Information Theory (ISIT), pp.174-179, 2022. 10.1109\/isit50566.2022.9834481","DOI":"10.1109\/ISIT50566.2022.9834481"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] F.M.J. Willems, Y.M. Shtarkov, and T.J. Tjalkens, \u201cThe context-tree weighting method: Basic properties,\u201d IEEE Trans. Inf. Theory, vol.41, no.3, pp.653-664, 1995. 10.1109\/18.382012","DOI":"10.1109\/18.382012"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] T. Matsushima and S. Hirasawa, \u201cA Bayes coding algorithm using context tree,\u201d Proc. 1994 IEEE International Symposium on Information Theory, p.386, 1994. 10.1109\/isit.1994.394633","DOI":"10.1109\/ISIT.1994.394633"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T. Matsushima and S. Hirasawa, \u201cReducing the space complexity of a Bayes coding algorithm using an expanded context tree,\u201d 2009 IEEE International Symposium on Information Theory, pp.719-723, June 2009. 10.1109\/isit.2009.5205677","DOI":"10.1109\/ISIT.2009.5205677"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] I. Papageorgiou, I. Kontoyiannis, L. Mertzanis, A. Panotopoulou, and M. Skoularidou, \u201cRevisiting context-tree weighting for bayesian inference,\u201d 2021 IEEE International Symposium on Information Theory (ISIT), pp.2906-2911, 2021. 10.1109\/isit45174.2021.9518189","DOI":"10.1109\/ISIT45174.2021.9518189"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] I. Kontoyiannis, L. Mertzanis, A. Panotopoulou, I. Papageorgiou, and M. Skoularidou, \u201cBayesian context trees: Modelling and exact inference for discrete time series,\u201d Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol.84, no.4, pp.1287-1323, 2022. 10.1111\/rssb.12511","DOI":"10.1111\/rssb.12511"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] I. Papageorgiou and I. Kontoyiannis, \u201cThe posterior distribution of Bayesian context-tree models: Theory and applications,\u201d 2022 IEEE International Symposium on Information Theory, June 2022. 10.1109\/isit50566.2022.9834791","DOI":"10.1109\/ISIT50566.2022.9834791"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] G.J. Sullivan, J. Ohm, W. Han, and T. Wiegand, \u201cOverview of the high efficiency video coding (HEVC) standard,\u201d IEEE Trans. Circuits Syst. Video Technol., vol.22, no.12, pp.1649-1668, Dec. 2012. 10.1109\/tcsvt.2012.2221191","DOI":"10.1109\/TCSVT.2012.2221191"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] Y. Nakahara and T. Matsushima, \u201cA stochastic model for block segmentation of images based on the quadtree and the Bayes code for it,\u201d Entropy, vol.23, no.8, p.991, 2021. 10.3390\/e23080991","DOI":"10.3390\/e23080991"},{"key":"10","unstructured":"[10] L. Breiman, J. Friedman, C.J. Stone, and R.A. Olshen, Classification and Regression Trees, CRC Press, 1984. 10.1201\/9781315139470-8"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] L. Breiman, \u201cRandom forests,\u201d Machine Learning, vol.45, no.1, pp.5-32, 2001. 10.1023\/a:1010933404324","DOI":"10.1023\/A:1010933404324"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] T. Chen and C. Guestrin, \u201cXGBoost: A scalable tree boosting system,\u201d Proc. 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201916, New York, NY, USA, pp.785-794, ACM, 2016. 10.1145\/2939672.2939785","DOI":"10.1145\/2939672.2939785"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] N. Dobashi, S. Saito, Y. Nakahara, and T. Matsushima, \u201cMeta-tree random forest: Probabilistic data-generative model and Bayes optimal prediction,\u201d Entropy, vol.23, no.6, p.768, 2021. 10.3390\/e23060768","DOI":"10.3390\/e23060768"},{"key":"14","unstructured":"[14] H. Akaike, \u201cInformation theory and an extension of the maximum likelihood principle,\u201d 2nd International Symposium on Information Theory, pp.267-281, 1973."},{"key":"15","unstructured":"[15] J.O. Berger, Statistical Decision Theory and Bayesian Analysis, Springer Science & Business Media, 2013."},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] T. Matsushima, H. Inazumi, and S. Hirasawa, \u201cA class of distortionless codes designed by Bayes decision theory,\u201d IEEE Trans. Inf. Theory, vol.37, no.5, pp.1288-1293, Sept. 1991. 10.1109\/18.133247","DOI":"10.1109\/18.133247"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Y. Nakahara, S. Saito, A. Kamatsuka, and T. Matsushima, \u201cProbability distribution on full rooted trees,\u201d Entropy, vol.24, no.3, p.328, 2022. 10.3390\/e24030328","DOI":"10.3390\/e24030328"},{"key":"18","unstructured":"[18] C. Bishop, Pattern Recognition and Machine Learning, Springer, Jan. 2006."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] Y. Nakahara and T. Matsushima, \u201cStochastic model of block segmentation based on improper quadtree and optimal code under the Bayes criterion,\u201d 2022 Data Compression Conference (DCC), pp.153-162, 2022. 10.1109\/dcc52660.2022.00023","DOI":"10.1109\/DCC52660.2022.00023"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025TAP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:11:34Z","timestamp":1772856694000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025TAP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025tap0005","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025TAP0005"}}