Table 7 Computational complexity of RFs
From: Data-driven multinomial random forest: a new random forest variant with strong consistency
RF variants | Complexity |
|---|---|
BreimanRF | \({\mathcal{O}}(\sqrt D nM\log n)\) |
BRF | \({\mathcal{O}}((p_{1} + (1 - p_{1} )\sqrt D )(1 - p_{2} )nM\log n)\) |
DMRF | \({\mathcal{O}}(\sqrt D nM\log n\) |
Denil14 | \({\mathcal{O}}(\min (1 + Poisson(\lambda ),D) \cdot mM\log n)\) |
MRF | \({\mathcal{O}}(DnM\log n)\) |