A Provable Algorithm for Learning Interpretable Scoring Systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

A Provable Algorithm for Learning Interpretable Scoring Systems

Résumé

Score learning aims at taking advantage of supervised learning to produce interpretable models which facilitate decision making. Scoring systems are simple classification models that let users quickly perform stratification. Ideally, a scoring system is based on simple arithmetic operations, is sparse, and can be easily explained by human experts. In this contribution, we introduce an original methodology to simultaneously learn interpretable binning mapped to a class variable, and the weights associated with these bins contributing to the score. We develop and show the theoretical guarantees for the proposed method. We demonstrate by numerical experiments on benchmark data sets that our approach is competitive compared to the state-of-the-art methods. We illustrate by a real medical problem of type 2 diabetes remission prediction that a scoring system learned automatically purely from data is comparable to one manually constructed by clinicians.
Fichier non déposé

Dates et versions

hal-03916854 , version 1 (31-12-2022)

Identifiants

  • HAL Id : hal-03916854 , version 1

Citer

Nataliya Sokolovska, Yann Chevaleyre, Jean-Daniel Zucker. A Provable Algorithm for Learning Interpretable Scoring Systems. Twenty-First International Conference on Artificial Intelligence and Statistics (AISTATS), Apr 2018, lanzarote, Spain. ⟨hal-03916854⟩
28 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More