Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Accurate estimation of feature importance faithfulness for tree models

Authors

[ 1 ] Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ SzD ] doctoral school student

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2025

Chapter type

chapter in monograph / paper

Publication language

english

Keywords
EN
  • explainability
  • explainable machine learning
  • tree models
Abstract

EN In this paper, we consider a perturbation-based metric of predictive faithfulness of feature rankings (or attributions) that we call PGI squared When applied to decision tree-based regression models, the metric can be computed exactly and efficiently for arbitrary independent feature perturbation distributions. In particular, the computation does not involve Monte Carlo sampling that has been typically used for computing similar metrics and which is inherently prone to inaccuracies. As a second contribution, we proposed a procedure for constructing feature ranking based on PGI squared. Our results indicate the proposed ranking method is comparable to the widely recognized SHAP explainer, offering a viable alternative for assessing feature importance in tree-based models.

Date of online publication

11.04.2025

Pages (from - to)

16691 - 16698

DOI

10.1609/aaai.v39i16.33834

URL

https://ojs.aaai.org/index.php/AAAI/article/view/33834

Comments

Vol. 39, No. 16: AAAI-25 Technical Tracks 16

Book

Proceedings of the 39th Annual AAAI Conference on Artificial Intelligence

Presented on

39th AAAI Conference on Artificial Intelligence, 25.02.2025 - 04.03.2025, Philadelphia, United States

Ministry points / chapter

5

Ministry points / conference (CORE)

200

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.