We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
Background: Random forests (RF) have been increasingly used in applications such as genome-wide association and microarray studies where predictor correlation is frequently observ...
Kristin K. Nicodemus, James D. Malley, Carolin Str...
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
We explore the problem of classifying images by the object categories they contain in the case of a large number of object categories. To this end we combine three ingredients: (i...
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...