{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:08:58Z","timestamp":1776751738787,"version":"3.51.2"},"reference-count":16,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP17K06446, JP19K04914, and JP19K14989"],"award-info":[{"award-number":["JP17K06446, JP19K04914, and JP19K14989"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper deals with a prediction problem of a new targeting variable corresponding to a new explanatory variable given a training dataset. To predict the targeting variable, we consider a model tree, which is used to represent a conditional probabilistic structure of a targeting variable given an explanatory variable, and discuss statistical optimality for prediction based on the Bayes decision theory. The optimal prediction based on the Bayes decision theory is given by weighting all the model trees in the model tree candidate set, where the model tree candidate set is a set of model trees in which the true model tree is assumed to be included. Because the number of all the model trees in the model tree candidate set increases exponentially according to the maximum depth of model trees, the computational complexity of weighting them increases exponentially according to the maximum depth of model trees. To solve this issue, we introduce a notion of meta-tree and propose an algorithm called MTRF (Meta-Tree Random Forest) by using multiple meta-trees. Theoretical and experimental analyses of the MTRF show the superiority of the MTRF to previous decision tree-based algorithms.<\/jats:p>","DOI":"10.3390\/e23060768","type":"journal-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T11:19:20Z","timestamp":1624015160000},"page":"768","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Meta-Tree Random Forest: Probabilistic Data-Generative Model and Bayes Optimal Prediction"],"prefix":"10.3390","volume":"23","author":[{"given":"Nao","family":"Dobashi","sequence":"first","affiliation":[{"name":"Department of Pure and Applied Mathematics, Waseda University, 3-4-1 Okubo, Shinjuku-ku, Tokyo 169-8555, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2256-4598","authenticated-orcid":false,"given":"Shota","family":"Saito","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Gunma University, 4-2, Maebashi, Gunma 371-8510, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0553-7910","authenticated-orcid":false,"given":"Yuta","family":"Nakahara","sequence":"additional","affiliation":[{"name":"Center for Data Science, Waseda University, 1-6-1 Nisniwaseda, Shinjuku-ku, Tokyo 169-8050, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyasu","family":"Matsushima","sequence":"additional","affiliation":[{"name":"Department of Pure and Applied Mathematics, Waseda University, 3-4-1 Okubo, Shinjuku-ku, Tokyo 169-8555, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"ref_1","unstructured":"Breiman, L., Friedman, J., Stone, C.J., and Olshen, R.A. (1984). Classification and Regression Trees, CRC Press."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random Forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Learn."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1214\/18-AOS1709","article-title":"Generalized Random Forests","volume":"47","author":"Athey","year":"2019","journal-title":"Ann. Stat."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S0167-9473(01)00065-2","article-title":"Stochastic Gradient Boosting","volume":"38","author":"Friedman","year":"2002","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Chen, T., and Guestrin, C. (2016, January 13\u201317). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201916), San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939785"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Schulter, S., Wohlhart, P., Leistner, C., Saffari, A., Roth, P.M., and Bischof, H. (2013, January 23\u201328). Alternating Decision Forests. Proceedings of the 2013 IEEE Conference on Computer Vision and Pattern Recognition, Portland, OR, USA.","DOI":"10.1109\/CVPR.2013.72"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1630","DOI":"10.1587\/transinf.2014OPP0004","article-title":"Boosted Random Forest","volume":"E98.D","author":"Mishina","year":"2015","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref_8","unstructured":"Bulo, S., and Kontschieder, P. (2014, January 23\u201328). Neural Decision Forests for Semantic Image Labelling. Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Kontschieder, P., Fiterau, M., Criminisi, A., and Bulo, S.R. (2015, January 7\u201313). Deep Neural Decision Forests. Proceedings of the 2015 IEEE International Conference on Computer Vision (ICCV), Santiago, Chile.","DOI":"10.1109\/ICCV.2015.172"},{"key":"ref_10","unstructured":"Tanno, R., Arulkumaran, K., Alexander, D., Criminisi, A., and Nori, A. (2019, January 9\u201315). Adaptive Neural Trees. Proceedings of the 36th International Conference on Machine Learning, Long Beach, CA, USA."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Zhou, Z.H., and Feng, J. (2017, January 19\u201325). Deep Forest: Towards An Alternative to Deep Neural Networks. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI-17), Melbourne, Australia.","DOI":"10.24963\/ijcai.2017\/497"},{"key":"ref_12","unstructured":"Frosst, N., and Hinton, G. (2017). Distilling a Neural Network Into a Soft Decision Tree. arXiv."},{"key":"ref_13","first-page":"93","article-title":"Prediction Algorithm for Decision Tree Model","volume":"103","author":"Suko","year":"2003","journal-title":"IEICE Tech. Rep. Theor. Found. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Berger, J.O. (1985). Statistical Decision Theory and Bayesian Analysis, Springer.","DOI":"10.1007\/978-1-4757-4286-2"},{"key":"ref_15","unstructured":"Matsushima, T., and Hirasawa, S. (July, January 27). A Bayes Coding Algorithm Using Context Tree. Proceedings of the 1994 IEEE International Symposium on Information Theory, Trondheim, Norway."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Nakahara, Y., and Matsushima, T. (2020, January 24\u201327). A Stochastic Model of Block Segmentation Based on the Quadtree and the Bayes Code for It. Proceedings of the 2020 Data Compression Conference (DCC), Snowbird, UT, USA.","DOI":"10.1109\/DCC47342.2020.00037"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/6\/768\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:18:21Z","timestamp":1760163501000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/6\/768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,18]]},"references-count":16,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2021,6]]}},"alternative-id":["e23060768"],"URL":"https:\/\/doi.org\/10.3390\/e23060768","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,18]]}}}