Metraipolis › archive › dc_6efcd0beac24

Self-Explaining Segment Trees: A KPI-Conditioned Segmentation Framework for Business Analytics with Node-Level Explanation via Recursive Subspace Partitioning — arXiv:2608.08197

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.08197
License (as archived)
CC0-1.0
Archived
2026-10-19T09:38:49.401Z
SHA-256 of the archived text
0322190390e1504e28cedf768237f34a15eff00ee84f2a456be6758a3f7653a0
Stable URL of this page
https://metraipolis.com/documento/dc_6efcd0beac24

How to cite

Self-Explaining Segment Trees: A KPI-Conditioned Segmentation Framework for Business Analytics with Node-Level Explanation via Recursive Subspace Partitioning — arXiv:2608.08197 — arXiv (en), https://arxiv.org/abs/2608.08197 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6efcd0beac24 (Metraipolis archive dc_6efcd0beac24, sha256 0322190390e1504e28cedf768237f34a15eff00ee84f2a456be6758a3f7653a0)
BibTeX
@misc{dc6efcd0beac24,
  title = {Self-Explaining Segment Trees: A KPI-Conditioned Segmentation Framework for Business Analytics with Node-Level Explanation via Recursive Subspace Partitioning — arXiv:2608.08197},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.08197},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6efcd0beac24; sha256 0322190390e1504e28cedf768237f34a15eff00ee84f2a456be6758a3f7653a0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08197. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Business users confronted with a moving metric need to know which part of their data moved and why. Existing data-explanation methods typically return predicates: conjunctions of attribute-value conditions that isolate responsible records. Predicates are exact and directly executable as filters, but they describe axis-aligned regions and may not compactly capture segments defined by combinations of continuous tendencies. This paper presents Self-Explaining Segment Trees (SEST), an architecture in which an explanation is a multivariate cluster in a feature subspace selected for relevance to a designated key performance indicator (KPI). SEST selects the subspace once per KPI using Shapley attributions over a decision-tree surrogate, recursively partitions the population while choosing the branching factor independently at each node through mixture-model silhouette search, and attaches to every node a dual explanation payload: standardized effect sizes over numeric features and type-dependent contribution profiles over user-designated dimensions. These explanations are computed from untransformed data so surfaced values retain source units and category labels. A stance layer reduces any depth of the tree to its extremal KPI-suppressing and KPI-amplifying segments. We establish termination and a node-count bound determined by the depth limit and minimum segment size, and characterize per-tree construction cost as quadratic in population size in the degenerate case and geometrically decaying across depth in the balanced case. This is an architecture and methodology paper; we report no predictive-accuracy or validation results and leave outcome validation to future work.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-08-11 in q-fin.GN).
Categorie arXiv: General Finance (q-fin.GN).
Pagina del lavoro: https://arxiv.org/abs/2608.08197 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:34:46.003Z dalla pagina https://arxiv.org/catchup/q-fin.GN/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).