treeshap
Compute SHAP Values for Your Tree-Based Models Using the 'TreeSHAP' Algorithm
An efficient implementation of the 'TreeSHAP' algorithm introduced by Lundberg et al., (2020) <doi:10.1038/s42256-019-0138-9>. It is capable of calculating SHAP (SHapley Additive exPlanations) values for tree-based models in polynomial time. Currently supported models include 'gbm', 'randomForest', 'ranger', 'xgboost', 'lightgbm'.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.4.0 |
rolling linux/jammy R-4.5 | treeshap_0.4.0.tar.gz |
1.1 MiB |
0.4.0 |
rolling linux/noble R-4.5 | treeshap_0.4.0.tar.gz |
1.1 MiB |
0.4.0 |
rolling source/ R- | treeshap_0.4.0.tar.gz |
808.0 KiB |
0.4.0 |
latest linux/jammy R-4.5 | treeshap_0.4.0.tar.gz |
1.1 MiB |
0.4.0 |
latest linux/noble R-4.5 | treeshap_0.4.0.tar.gz |
1.1 MiB |
0.4.0 |
latest source/ R- | treeshap_0.4.0.tar.gz |
808.0 KiB |
0.4.0 |
2026-04-26 source/ R- | treeshap_0.4.0.tar.gz |
808.0 KiB |
0.4.0 |
2026-04-23 source/ R- | treeshap_0.4.0.tar.gz |
0 B |
0.3.1 |
2025-04-20 source/ R- | treeshap_0.3.1.tar.gz |
795.3 KiB |