Mining Pareto-optimal counterfactual antecedents with a branch-and-bound model-agnostic algorithm.
Saved in:
| Title: | Mining Pareto-optimal counterfactual antecedents with a branch-and-bound model-agnostic algorithm. |
|---|---|
| Authors: | Raimundo, Marcos M.1,2, mraimundo@ic.unicamp.br, Nonato, Luis Gustavo3,4, Poco, Jorge1,5 |
| Source: | Data Mining & Knowledge Discovery; Sep2024, Vol. 38 Issue 5, p2942-2974, 33p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
