Pure interaction effects unseen by Random Forests
Ricardo Blum, Munir Hiabu, Enno Mammen, Joseph Theo Meyer

TL;DR
This paper investigates the limitations of Random Forests in capturing pure interaction effects and proposes alternative tree partitioning methods that improve interaction detection, validated through simulations and real data applications.
Contribution
It introduces modified tree-growing schemes that better identify pure interactions, addressing a gap in standard Random Forest algorithms.
Findings
Modified schemes outperform standard Random Forests in pure interaction scenarios
Enhanced detection of pure interactions in simulation studies
Improved model fitting on real datasets with interaction effects
Abstract
Random Forests are widely claimed to capture interactions well. However, some simple examples suggest that they perform poorly in the presence of certain pure interactions that the conventional CART criterion struggles to capture during tree construction. Motivated from this, it is argued that simple alternative partitioning schemes used in the tree growing procedure can enhance identification of these interactions. In a simulation study these variants are compared to conventional Random Forests and Extremely Randomized Trees. The results validate that the modifications considered enhance the model's fitting ability in scenarios where pure interactions play a crucial role. Finally, the methods are applied to real datasets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Rough Sets and Fuzzy Logic · Neural Networks and Applications
