Journal article · 2019 · Open access
On PAC-Bayesian bounds for random forests
Machine Learning, 108(8-9), 1503–1522 · Published 13 May 2019 · DOI 10.1007/s10994-019-05803-4
In brief
“On PAC-Bayesian bounds for random forests” is a 2019 journal article by Stephan Sloth Lorenzen and 2 co-authors, published in Machine Learning. OpenAlex counts 10 citations as of 16 November 2026. It is open access: the full text is free to read at Machine Learning.
- Citations
- 10
- Most cited in
- 2021 (2)
- Field-weighted impact
- 0.50
- References
- 30
- Authors
- 3
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Lorenzen, S. S., Igel, C., & Seldin, Y. (2019). On PAC-Bayesian bounds for random forests. Machine Learning, 108(8-9), 1503–1522. https://doi.org/10.1007/s10994-019-05803-4
MLA 9
Lorenzen, Stephan Sloth, et al. “On PAC-Bayesian bounds for random forests.” Machine Learning, vol. 108, no. 8-9, 2019, pp. 1503–1522. https://doi.org/10.1007/s10994-019-05803-4.
Chicago
Lorenzen, Stephan Sloth, Christian Igel, and Yevgeny Seldin. 2019. “On PAC-Bayesian bounds for random forests.” Machine Learning 108 (8-9): 1503–1522. https://doi.org/10.1007/s10994-019-05803-4.
Harvard
Lorenzen, S. S., Igel, C. and Seldin, Y. (2019) ‘On PAC-Bayesian bounds for random forests’, Machine Learning, 108(8-9), pp. 1503–1522. doi:10.1007/s10994-019-05803-4.
IEEE
S. S. Lorenzen, C. Igel, and Y. Seldin, “On PAC-Bayesian bounds for random forests,” Machine Learning, vol. 108, no. 8-9, pp. 1503–1522, 2019, doi: 10.1007/s10994-019-05803-4.
BibTeX
@article{lorenzen2019bayesian,
title = {{On PAC-Bayesian bounds for random forests}},
author = {Lorenzen, Stephan Sloth and Igel, Christian and Seldin, Yevgeny},
journal = {Machine Learning},
year = {2019},
volume = {108},
number = {8-9},
pages = {1503--1522},
doi = {10.1007/s10994-019-05803-4},
url = {https://doi.org/10.1007/s10994-019-05803-4}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 1 | |
| 2021 | 2 | |
| 2022 | 2 | |
| 2023 | 1 | |
| 2024 | 2 | |
| 2026 | 2 |
Its field-weighted citation impact is 0.50: it has been cited 0.50 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- random forest
- PAC-Bayesian bounds
- generalization bounds
- majority voting
- ensemble classifiers
- error correlation
- decision tree
- validation set
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Lorenzen, S. S., Igel, C., & Seldin, Y. (2019). On PAC-Bayesian bounds for random forests. Machine Learning, 108(8-9), 1503–1522. https://doi.org/10.1007/s10994-019-05803-4
How many times has this paper been cited?
10 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Machine Learning: sign in and open the PDF from this page.
Who wrote this paper?
Stephan Sloth Lorenzen, Christian Igel, Yevgeny Seldin.
What is the DOI of this paper?
10.1007/s10994-019-05803-4, permanently at https://doi.org/10.1007/s10994-019-05803-4. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.