mlsanityData to 14 Oct 2026

Forest-Guided Clustering -- Shedding Light into the Random Forest Black Box

arXiv 2507.19455 ↗First posted 25 Jul 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

As machine learning models are increasingly deployed in sensitive application areas, the demand for interpretable and trustworthy decision-making has increased. Random Forests (RF), despite their widespread use and strong performance on tabular data, remain difficult to interpret due to their ensemble nature. We present Forest-Guided Clustering (FGC), a model-specific explainability method that reveals both local and global structure in RFs by grouping instances according to shared decision paths. FGC produces human-interpretable clusters aligned with the model's internal logic and computes cluster-specific and global feature importance scores to derive decision rules underlying RF predictions. FGC accurately recovered latent subclass structure on a benchmark dataset and outperformed classical clustering and post-hoc explanation methods. Applied to an AML transcriptomic dataset, FGC uncovered biologically coherent subpopulations, disentangled disease-relevant signals from confounders, and recovered known and novel gene expression patterns. FGC bridges the gap between performance and interpretability by providing structure-aware insights that go beyond feature-level attribution.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 73 references that are in the map. First posted on arXiv 25 Jul 2025.

Builds on

7 of 73 references.

References · 7

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  2. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,070
  3. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,416
  4. 2020Ethical Machine Learning in Health Carecited by 113
  5. 2019On a generalization of the Jensen-Shannon divergence and the JS-symmetrization of distances relying on abstract meanscited by 61
  6. 2018Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithmscited by 44
  7. 2020Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithmscited by 36

Built on by

Not cited yet.