On marginal feature attributions of tree-based models
From MaRDI portal
Publication:6620135
DOI10.3934/FODS.2024021MaRDI QIDQ6620135FDOQ6620135
Authors: Khashayar Filom, Alexey Miroshnikov, Konstandinos Kotsiopoulos, Arjun Ravi Kannan
Publication date: 16 October 2024
Published in: Foundations of Data Science (Search for Journal in Brave)
Trees (05C05) Cooperative games (91A12) Applications of game theory (91A80) Combinatorial identities, bijective combinatorics (05A19) (n)-person games, (n>2) (91A06) General topics in artificial intelligence (68T01) Algorithmic game theory and complexity (91A68)
Cites Work
- Greedy function approximation: A gradient boosting machine.
- Random forests
- Measuring dependence powerfully and equitably
- Title not available (Why is that?)
- Monotonic solutions of cooperative games
- Cooperative games with coalition structures
- Theory of probability and random processes.
- Title not available (Why is that?)
- A two-step Shapley value for cooperative games with coalition structures
- The Elements of Statistical Learning
- Explaining individual predictions when features are dependent: more accurate approximations to Shapley values
- Supervised Machine Learning Techniques: An Overview with Applications to Banking
This page was built for publication: On marginal feature attributions of tree-based models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6620135)