Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweaking
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Machine-learned models are often described as "black boxes". In many real-world applications however, models may have to sacrifice predictive power in favour of human-interpretability. When this is the case, feature engineering becomes a crucial task, which requires significant and time-consuming human effort. Whilst some features are inherently static, representing properties that cannot be influenced (e.g., the age of an individual), others capture characteristics that could be adjusted (e.g., the daily amount of carbohydrates taken). Nonetheless, once a model is learned from the data, each prediction it makes on new instances is irreversible - assuming every instance to be a static point located in the chosen feature space. There are many circumstances however where it is important to understand (i) why a model outputs a certain prediction on a given instance, (ii) which adjustable features of that instance should be modified, and finally (iii) how to alter such a prediction when the mutated instance is input back to the model.
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
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Intriguing properties of neural networks
Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., & Fergus, R. (2013) · arXiv · doi:10.48550/arxiv.1312.6199 · Cited by 8,143
Model-Agnostic Interpretability of Machine Learning
Ribeiro, M. T., Singh, S., & Guestrin, C. (2016) · arXiv · doi:10.48550/arxiv.1606.05386 · Cited by 699 · cited 1×
“…space; (ii) We ϵ change that each feature can sustain; (iii) We experiment with five δ (iv) We leverage on the importance of each feature derived from the model to rank the final list of recommendations; (v) We focus More recent work on related topics are those of Ribeiro et al. [20, e.g. e.g.”
Method
Research works printed but not linked: 5
- Nicola Barbieri , Fabrizio Silvestri , and Mounia Lalmas . 2016 . Improving Post-Click User Engagement on Native Ads via Survival Analysis WWW '16 . International World Wide Web Conferences Steering Committee, 761--770 . Nicola Barbieri, Fabrizio Silvestri, and Mounia Lalmas. 2016. Improving Post-Click User Engagement on Native Ads via Survival Analysis WWW '16. International World Wide Web Conferences Steering Committee, 761--770.
- 10.1109/TKDE.2007.250584 · DOI
- Qiang Yang , Jie Yin , Charles X. Ling , and Tielin Chen . 2003. Postprocessing Decision Trees to Extract Actionable Knowledge ICDM '03 . IEEE Computer Society , 685--688. Qiang Yang, Jie Yin, Charles X. Ling, and Tielin Chen. 2003. Postprocessing Decision Trees to Extract Actionable Knowledge ICDM '03. IEEE Computer Society, 685--688.
- 10.1007/s10994-010-5221-8 · DOI · Paper page
- Ke Zhou , Miriam Redi , Andrew Haines , and Mounia Lalmas . 2016 . Predicting Pre-click Quality for Native Advertisements WWW '16. International World Wide Web Conferences Steering Committee, 299--310 . Ke Zhou, Miriam Redi, Andrew Haines, and Mounia Lalmas. 2016. Predicting Pre-click Quality for Native Advertisements WWW '16. International World Wide Web Conferences Steering Committee, 299--310.
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
“Finally, a crosswise technique among post-hoc explainability, [240] proposes a framework that poses recommendations that, if taken, would convert an example from one class to another.”
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
Questioning the AI: Informing Design Practices for Explainable AI User Experiences
Liao, Q. V., Gruen, D., & Miller, S. (2020) · Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3313831.3376590 · Cited by 925
Interpretable Machine Learning – A Brief History, State-of-the-Art and Challenges
Molnar, C., Casalicchio, G., & Bischl, B. (2020) · Communications in Computer and Information Science · doi:10.1007/978-3-030-65965-3_28 · Cited by 677
Nauta, M., Trienes, J., Pathak, S., Nguyen, E., Peters, M., Schmitt, Y., Schlötterer, J., van Keulen, M., & Seifert, C. (2023) · ACM Computing Surveys · doi:10.1145/3583558 · Cited by 590
Counterfactual explanations and how to find them: literature review and benchmarking
Guidotti, R. (2024) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-022-00831-6 · Cited by 471
A Survey of Algorithmic Recourse: Contrastive Explanations and Consequential Recommendations
Karimi, A.-H., Barthe, G., Schölkopf, B., & Valera, I. (2023) · ACM Computing Surveys · doi:10.1145/3527848 · Cited by 301
Multi-Objective Counterfactual Explanations
Dandl, S., Molnar, C., Binder, M., & Bischl, B. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58112-1_31 · Cited by 271
Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review
Verma, S., Boonsanong, V., Hoang, M., Hines, K. E., Dickerson, J. P., & Shah, C. (2020) · arXiv · doi:10.48550/arxiv.2010.10596 · Cited by 267
Explainability fact sheets: a framework for systematic assessment of explainable approaches
Sokol, K., & Flach, P. (2020) · Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency · doi:10.1145/3351095.3372870 · Cited by 264
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
“In Reference [121], a solution for the model explanation problem is presented.”
Learning Model-Agnostic Counterfactual Explanations for Tabular Data
Pawelczyk, M., Broelemann, K., & Kasneci, G. (2020) · Proceedings of The Web Conference 2020 · doi:10.1145/3366423.3380087 · Cited by 167
“[18] assume the pretrained classifiers to be linear or tree based respectively, which can restrict usefulness.”
BackgroundBarr Kumarakulasinghe, N., Blomberg, T., Liu, J., Saraiva Leao, A., & Papapetrou, P. (2020) · 2020 IEEE 33rd International Symposium on Computer-Based Medical Systems (CBMS) · doi:10.1109/cbms49503.2020.00009 · Cited by 133
Interpretable Anomaly Detection with DIFFI: Depth-based feature importance of Isolation Forest
Carletti, M., Terzi, M., & Susto, G. A. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105730 · Cited by 118
Principles and Practice of Explainable Machine Learning
Belle, V., & Papantonis, I. (2021) · Frontiers in Big Data · doi:10.3389/fdata.2021.688969 · Cited by 99
“• A different approach on measuring a feature’s importance can be found in [81].”
BackgroundSurvey on Explainable AI: Techniques, challenges and open issues
Abusitta, A., Li, M. Q., & Fung, B. C. M. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124710 · Cited by 98
Random forest explainability using counterfactual sets
Fernández, R. R., Martín de Diego, I., Aceña, V., Fernández-Isabel, A., & Moguerza, J. M. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.07.001 · Cited by 73
Explainable Time Series Tweaking via Irreversible and Reversible Temporal Transformations
Karlsson, I., Rebane, J., Papapetrou, P., & Gionis, A. (2018) · 2018 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2018.00036 · Cited by 31
RetroLens: A Human-AI Collaborative System for Multi-step Retrosynthetic Route Planning
Shi, C., Hu, Y., Wang, S., Ma, S., Zheng, C., Ma, X., & Luo, Q. (2023) · Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems · doi:10.1145/3544548.3581469 · Cited by 19
Metadata
- Authors
- Tolomei, G., Silvestri, F., Haines, A., & Lalmas, M.
- Venue
- Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
- Publisher
- ACM
- Published
- 2017-08-04
- Pages
- 465-474
- OpenAlex
- W2715209044
- Cited by
- 129
- References
- 5
- FWCI
- 4.19
- Type
- conference paper
- 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.