Supplementary Material for the Paper " Joints in Random Forests "

Neural Information Processing Systems 

Then f (x) = p( Y | x), provided that p (x) > 0. Proof. Since the GeDT is deterministic, it has at most one non-zero child. Before proving Theorem 2 we need to introduce some background. We are now ready to prove Theorem 2. Proof. (see also proof of Theorem 1). Here, we assume for simplicity that all variables are continuous.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found