{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T10:29:15Z","timestamp":1768904955965,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100012774","name":"Innovationsfonden","doi-asserted-by":"publisher","award":["Danish Center for Big Data Analytics Driven Innovation (DABAI)"],"award-info":[{"award-number":["Danish Center for Big Data Analytics Driven Innovation (DABAI)"]}],"id":[{"id":"10.13039\/100012774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10994-019-05803-4","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T04:03:33Z","timestamp":1557806613000},"page":"1503-1522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On PAC-Bayesian bounds for random forests"],"prefix":"10.1007","volume":"108","author":[{"given":"Stephan S.","family":"Lorenzen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2868-0856","authenticated-orcid":false,"given":"Christian","family":"Igel","sequence":"additional","affiliation":[]},{"given":"Yevgeny","family":"Seldin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"key":"5803_CR1","unstructured":"Andersen, M., & Vandenberghe, L. (2019). CVXOPT. Retrieved May, 2019 from \n                    http:\/\/cvxopt.org\/\n                    \n                  ."},{"key":"5803_CR2","unstructured":"Arlot, S., & Genuer, R. (2014). Analysis of purely random forests bias. \n                    arXiv:1407.3939\n                    \n                  ."},{"issue":"1","key":"5803_CR3","first-page":"1063","volume":"13","author":"G Biau","year":"2012","unstructured":"Biau, G. (2012). Analysis of a random forests model. Journal of Machine Learning Research, 13(1), 1063\u20131095.","journal-title":"Journal of Machine Learning Research"},{"key":"5803_CR4","first-page":"2015","volume":"9","author":"G Biau","year":"2008","unstructured":"Biau, G., Devroye, L., & Lugosi, G. (2008). Consistency of random forests and other averaging classifiers. Journal of Machine Learning Research, 9, 2015\u20132033.","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"5803_CR5","first-page":"123","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L. (1996a). Bagging predictors. Machine Learning, 24(2), 123\u2013140.","journal-title":"Machine Learning"},{"key":"5803_CR6","unstructured":"Breiman, L. (1996b). Out-of-bag estimation. Retrieved May, 2019 from \n                    https:\/\/www.stat.berkeley.edu\/users\/breiman\/OOBestimation.pdf\n                    \n                  ."},{"issue":"1","key":"5803_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5\u201332.","journal-title":"Machine Learning"},{"key":"5803_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/jcta.2001.3238","volume":"98","author":"L Breiman","year":"2002","unstructured":"Breiman, L. (2002). Some infinity theory for predictor ensembles. Journal of Combinatorial Theory A, 98, 175\u2013191.","journal-title":"Journal of Combinatorial Theory A"},{"key":"5803_CR9","unstructured":"Denil, M., Matheson, D., & Freitas, N. D. (2014). Narrowing the gap: Random forests in theory and in practice. In Proceedings of the 31st international conference on machine learning (ICML), PMLR, Proceedings of machine learning research (Vol.\u00a032, pp. 665\u2013673)."},{"key":"5803_CR10","first-page":"3133","volume":"15","author":"M Fern\u00e1ndez-Delgado","year":"2014","unstructured":"Fern\u00e1ndez-Delgado, M., Cernadas, E., Barro, S., & Amorim, D. (2014). Do we need hundreds of classifiers to solve real world classification problems? Journal of Machine Learning Research, 15, 3133\u20133181.","journal-title":"Journal of Machine Learning Research"},{"key":"5803_CR11","unstructured":"Genuer, R. (2010). Risk bounds for purely uniformly random forests. Technical report. France: Institut National de Recherche en Informatique et en Automatique."},{"key":"5803_CR12","first-page":"787","volume":"16","author":"P Germain","year":"2015","unstructured":"Germain, P., Lacasse, A., Laviolette, F., Marchand, M., & Roy, J. F. (2015). Risk bounds for the majority vote: From a PAC-Bayesian analysis to a learning algorithm. Journal of Machine Learning Research, 16, 787\u2013860.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"5803_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3\u201342.","journal-title":"Machine Learning"},{"key":"5803_CR14","doi-asserted-by":"crossref","unstructured":"Gieseke, F., & Igel, C. (2018). Training big random forests with little resources. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining (KDD) (pp. 1445\u20131454). ACM Press.","DOI":"10.1145\/3219819.3220124"},{"key":"5803_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The elements of statistical learning","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., & Friedman, J. (2009). The elements of statistical learning (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"5803_CR16","unstructured":"Langford, J., & Shawe-Taylor, J. (2002). PAC-Bayes & Margins. In Proceedings of the 15th international conference on neural information processing systems (pp. 439\u2013446). MIT Press."},{"key":"5803_CR17","unstructured":"Maurer, A. (2004). A note on the PAC-Bayesian theorem. \n                    arXiv:cs\/0411099\n                    \n                  ."},{"key":"5803_CR18","doi-asserted-by":"crossref","unstructured":"Mcallester, D. (2003). Simplified PAC-Bayesian margin bounds. In Proceedings of the 16th annual conference on computational learning theory (COLT). LNCS (Vol. 2777, pp. 203\u2013215). Springer.","DOI":"10.1007\/978-3-540-45167-9_16"},{"key":"5803_CR19","doi-asserted-by":"crossref","unstructured":"McAllester, D. A. (1998). Some PAC-Bayesian theorems. In Proceedings of the eleventh annual conference on computational learning theory (COLT) (pp. 230\u2013234). ACM.","DOI":"10.1145\/279943.279989"},{"key":"5803_CR20","doi-asserted-by":"crossref","unstructured":"McAllester, D. A. (1999). PAC-Bayesian model averaging. In Proceedings of the twelfth annual conference on computational learning theory (COLT) (pp. 164\u2013170). ACM.","DOI":"10.1145\/307400.307435"},{"key":"5803_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.neucom.2017.10.066","volume":"298","author":"L Oneto","year":"2018","unstructured":"Oneto, L., Cipollini, F., Ridella, S., & Anguita, D. (2018). Randomized learning: Generalization performance of old and new theoretically grounded algorithms. Neurocomputing, 298, 21\u201333.","journal-title":"Neurocomputing"},{"issue":"3","key":"5803_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Schapire","year":"1999","unstructured":"Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37(3), 297\u2013336.","journal-title":"Machine Learning"},{"key":"5803_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1162\/153244303765208377","volume":"3","author":"M Seeger","year":"2002","unstructured":"Seeger, M. (2002). PAC-Bayesian generalization error bounds for Gaussian process classification. Journal of Machine Learning Research, 3, 233\u2013269.","journal-title":"Journal of Machine Learning Research"},{"key":"5803_CR24","unstructured":"Thiemann, N., Igel, C., Wintenberger, O., & Seldin, Y. (2017). A strongly quasiconvex PAC-Bayesian bound. In Proceedings of the international conference on algorithmic learning theory (ALT), PMLR, Proceedings of machine learning research (Vol.\u00a076, pp. 466\u2013492)."},{"issue":"11","key":"5803_CR25","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"5803_CR26","unstructured":"Wang, Y., Tang, Q., Xia, S.T., Wu, J., & Zhu, X. (2016). Bernoulli random forests: Closing the gap between theoretical consistency and empirical soundness. In Proceedings of the 17th international conference on machine learning (ICML) (pp. 2167\u20132173). Morgan Kaufmann."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05803-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05803-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05803-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T00:05:51Z","timestamp":1589328351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05803-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":26,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["5803"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05803-4","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"18 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}