Consistency of Online Random Forests

Misha Denil, David Matheson, Nando Freitas
Proceedings of the 30th International Conference on Machine Learning, PMLR 28(3):1256-1264, 2013.

Abstract

As a testament to their success, the theory of random forests has long been outpaced by their application in practice. In this paper, we take a step towards narrowing this gap by providing a consistency result for online random forests.

Cite this Paper

BibTeX
@InProceedings{pmlr-v28-denil13, title = {Consistency of Online Random Forests}, author = {Denil, Misha and Matheson, David and Freitas, Nando}, booktitle = {Proceedings of the 30th International Conference on Machine Learning}, pages = {1256--1264}, year = {2013}, editor = {Dasgupta, Sanjoy and McAllester, David}, volume = {28}, number = {3}, series = {Proceedings of Machine Learning Research}, address = {Atlanta, Georgia, USA}, month = {17--19 Jun}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v28/denil13.pdf}, url = {https://proceedings.mlr.press/v28/denil13.html}, abstract = {As a testament to their success, the theory of random forests has long been outpaced by their application in practice. In this paper, we take a step towards narrowing this gap by providing a consistency result for online random forests.} }
Endnote
%0 Conference Paper %T Consistency of Online Random Forests %A Misha Denil %A David Matheson %A Nando Freitas %B Proceedings of the 30th International Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2013 %E Sanjoy Dasgupta %E David McAllester %F pmlr-v28-denil13 %I PMLR %P 1256--1264 %U https://proceedings.mlr.press/v28/denil13.html %V 28 %N 3 %X As a testament to their success, the theory of random forests has long been outpaced by their application in practice. In this paper, we take a step towards narrowing this gap by providing a consistency result for online random forests.
RIS
TY - CPAPER TI - Consistency of Online Random Forests AU - Misha Denil AU - David Matheson AU - Nando Freitas BT - Proceedings of the 30th International Conference on Machine Learning DA - 2013/05/26 ED - Sanjoy Dasgupta ED - David McAllester ID - pmlr-v28-denil13 PB - PMLR DP - Proceedings of Machine Learning Research VL - 28 IS - 3 SP - 1256 EP - 1264 L1 - http://proceedings.mlr.press/v28/denil13.pdf UR - https://proceedings.mlr.press/v28/denil13.html AB - As a testament to their success, the theory of random forests has long been outpaced by their application in practice. In this paper, we take a step towards narrowing this gap by providing a consistency result for online random forests. ER -
APA
Denil, M., Matheson, D. & Freitas, N.. (2013). Consistency of Online Random Forests. Proceedings of the 30th International Conference on Machine Learning, in Proceedings of Machine Learning Research 28(3):1256-1264 Available from https://proceedings.mlr.press/v28/denil13.html.

Related Material