ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2303.02883
  4. Cited By
Very fast, approximate counterfactual explanations for decision forests

Very fast, approximate counterfactual explanations for decision forests

6 March 2023
Miguel Á. Carreira-Perpiñán
Suryabhan Singh Hada
ArXivPDFHTML

Papers citing "Very fast, approximate counterfactual explanations for decision forests"

2 / 2 papers shown
Title
Learning Decision Trees and Forests with Algorithmic Recourse
Learning Decision Trees and Forests with Algorithmic Recourse
Kentaro Kanamori
Takuya Takagi
Ken Kobayashi
Yuichi Ike
48
3
0
03 Jun 2024
Inverse classification with logistic and softmax classifiers: efficient
  optimization
Inverse classification with logistic and softmax classifiers: efficient optimization
Miguel Á. Carreira-Perpiñán
Suryabhan Singh Hada
24
1
0
16 Sep 2023
1