The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Interpreting tree ensembles with inTrees
Open accessAbstract
Tree ensembles such as random forests and boosted trees are accurate but difficult to understand. In this work, we provide the interpretable trees (inTrees) framework that extracts, measures, prunes, selects, and summarizes rules from a tree ensemble, and calculates frequent variable interactions. The inTrees framework can be applied to multiple types of tree ensembles, e.g., random forests, regularized random forests, and boosted trees. We implemented the inTrees algorithms in the “inTrees” R package.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Classification and Regression by randomForest
Liaw, A. I., & Wiener, M. C. (2007) · Cited by 18,594
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,419
Integrating classification and association rule mining
Liu, B., Hsu, W., & Ma, Y. (1998) · Cited by 2,247
Predictive learning via rule ensembles
Friedman, J. H., & Popescu, B. E. (2008) · The Annals of Applied Statistics · doi:10.1214/07-aoas148 · Cited by 1,315 · cited 1×
“ables as items. 8. Simplified tree ensemble learner (STEL) The rules extracted from a tree ensemble can be summarized into a rulebased learner, referred to as a simplified tree ensemble learner (STEL). [8] used a linear model summarizing the rules from a tree ensemble. Also, ideas in summarize associative classification…”
BackgroundBishop, C. M. (2004) · Handbook of Neural Computation · doi:10.1887/0750303123/b365c43 · Cited by 833
Generalized Boosted Models: A guide to the gbm package
Ridgeway, G. K. (2006) · Cited by 814
Leakage in data mining: Formulation, detection, and avoidance
Kaufman, S., Rosset, S., Perlich, C., & Stitelman, O. (2012) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2382577.2382579 · Cited by 791
A Survey of Methods for Explaining Black Box Models
Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., & Pedreschi, D. (2019) · ACM Computing Surveys · doi:10.1145/3236009 · Cited by 629
Gene selection with guided regularized random forest
Deng, H., & Runger, G. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.018 · Cited by 304
Self-citationMeinshausen, N. (2010) · The Annals of Applied Statistics · doi:10.1214/10-aoas367 · Cited by 151
SSD Failures in Datacenters: What? When? and Why?
Narayanan, I., Wang, D., Jeon, M., Sharma, B., Caulfield, L., Sivasubramaniam, A., Cutler, B., Liu, J., Khessib, B., & Vaid, K. (2016) · ACM International Systems and Storage Conference (SYSTOR) · doi:10.1145/2928275.2928278 · Cited by 126
Miraboutalebi, S. M., Kazemi, P., & Bahrami, P. (2015) · Fuel · doi:10.1016/j.fuel.2015.10.118 · Cited by 117
Eskandarian, S., Bahrami, P., & Kazemi, P. (2017) · Journal of Petroleum Science and Engineering · doi:10.1016/j.petrol.2017.06.039 · Cited by 87
CBC: An associative classifier with a small number of rules
Deng, H., Runger, G. C., Tuv, E., & Bannister, W. M. (2013) · Decision Support Systems · doi:10.1016/j.dss.2013.11.004 · Cited by 35
Self-citationSzlęk, J., Pacławski, A., Lau, R. W. M., Jachowicz, R., Kazemi, P., & Mendyk, A. (2016) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2016.07.006 · Cited by 23
Gallego-Ortiz, C., & Martel, A. L. (2017) · PLoS ONE · doi:10.1371/journal.pone.0187501 · Cited by 21
A Genetic Algorithm for Interpretable Model Extraction from Decision Tree Ensembles
Vandewiele, G., Lannoye, K., Janssens, O., Ongenae, F., Turck, F. D., & Hoecke, S. V. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-67274-8_10 · Cited by 20
Discovery of cell-type specific DNA motif grammar in cis-regulatory elements using random Forest
Wang, X., Lin, P., & Ho, J. W. K. (2018) · BMC Genomics · doi:10.1186/s12864-017-4340-z · Cited by 20
Modeling the interaction between sensory and affective meanings for detecting metaphor
Gargett, A., & Barnden, J. A. (2015) · Workshop on Metaphor in NLP · doi:10.3115/v1/w15-1403 · Cited by 16
pre: Prediction Rule Ensembles
Fokkema, M., & Christoffersen, B. (2016) · doi:10.32614/cran.package.pre · Cited by 6
Cited by
Arrieta, A. B., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., García, S., Gil-López, S., Molina, D., Benjamins, R., et al. (2019) · arXiv · doi:10.48550/arxiv.1910.10045 · Cited by 11,321
Barredo Arrieta, A., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., Garcia, S., Gil-Lopez, S., Molina, D., Benjamins, R., et al. (2020) · Information Fusion · doi:10.1016/j.inffus.2019.12.012 · Cited by 10,423
Drug discovery with explainable artificial intelligence
Jiménez-Luna, J., Grisoni, F., & Schneider, G. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-00236-4 · Cited by 1,063
Explainable artificial intelligence: a comprehensive review
Minh, D., Wang, H. X., Li, Y. F., & Nguyen, T. N. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10088-y · Cited by 983
Dumitrescu, E., Hué, S., Hurlin, C., & Tokpavi, S. (2022) · European Journal of Operational Research · doi:10.1016/j.ejor.2021.06.053 · Cited by 430
Metadata
- Authors
- Deng, H.
- Venue
- International Journal of Data Science and Analytics
- Published
- 2018-07-11
- Volume
- 7
- Issue
- 4
- Pages
- 277-287
- ISSN
- 2364-415X (ISSN-L)
- 2364-4168
- OpenAlex
- W2963292722
- Cited by
- 253
- References
- 27
- FWCI
- 15.42
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.