Consistency of Online Random Forests

2013/02/20 by Misha Denil, Denil, Misha, David S. Matheson +2 · 2 citations
Computer Science · #Data Management and Algorithms #Data Stream Mining Techniques #FOS: Computer and information sciences #Machine Learning (stat.ML) #Machine Learning and Data Classification

paper · pdf · doi:10.48550/arxiv.1302.4853

openalex publication_date 2013/02/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• Narrowing the Gap: Random Forests In Theory and In Practice
• Differentially- and non-differentially-private random decision trees

Related

• Narrowing the Gap: Random Forests In Theory and In Practice
• Grafting: Making Random Forests Consistent
• Consistency of Random Forest Type Algorithms under a Probabilistic Impurity Decrease Condition
• On the asymptotics of random forests
• Universal consistency and minimax rates for online Mondrian Forests