Name
Abstract | ||
|---|---|---|
Despite widespread interest and practical use, the theoretical properties of random forests are still not well understood. In this paper we contribute to this understanding in two ways. We present a new theoretically tractable variant of random regression forests and prove that our algorithm is consistent. We also provide an empirical evaluation, comparing our algorithm and other theoretically tractable random forest models to the random forest algorithm used in practice. Our experiments provide insight into the relative importance of different simplifications that theoreticians have made to obtain tractable models for analysis. |
Year | Venue | DocType |
|---|---|---|
2014 | international conference on machine learning | Conference |
Volume | Citations | PageRank |
abs/1310.1415 | 20 | 1.20 |
References | Authors | |
15 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Misha Denil | 1 | 397 | 26.18 |
| David Matheson | 2 | 114 | 4.90 |
| Nando De Freitas | 3 | 3284 | 273.68 |