We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from a tree ensemble, and calculates frequent variable interactions. An rule-based learner, referred to as the simplified tree ensemble learner (STEL), can also be formed and used for future prediction. The inTrees framework can applied to both classification and regression problems, and is applicable to many types of tree ensembles, e.g., random forests, regularized random forests, and boosted trees. We implemented the inTrees algorithms in the "inTrees" R package.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1408.5456")
get_code_for_paper("1408.5456")
have("1408.5456")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1408.5456.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1408.5456)
Connect an agent — have() is free.