Concordance probability in a big data setting: application in non-life insurance
The concordance probability or C-index is a popular measure to capture the discriminatory ability of a regression model. In this article, the definition of this measure is adapted to the specific needs of the frequency and severity model, typically used during the technical pricing of a non-life insurance product. Due to the typical large sample size of the frequency data in particular, two different adaptations of the estimation procedure of the concordance probability are presented. Note that the latter procedures can be applied to all different versions of the concordance probability.
Code (0)
등록된 구현이 없습니다.
Tasks
regressionSimilar Papers 제목 키워드 기반
Computational Efficient Approximations of the Concordance Probability in a Big Data Setting
Performance measurement is an essential task once a statistical model is created. The Area Under the receiving operating characteristics Curve (AUC) is the most popular measure for evaluating the quality of a binary clas…
Disappointment concordance and duet expectiles
We introduce an axiom of disappointment-concordance (disco) aversion for a preference relation over acts in an Anscombe-Aumann setting. This axiom means that the decision maker, facing the sum of two acts, dislikes the s…
Validation of Diagnostic Artificial Intelligence Models for Prostate Pathology in a Middle Eastern Cohort
Background: Artificial intelligence (AI) is improving the efficiency and accuracy of cancer diagnostics. The performance of pathology AI systems has been almost exclusively evaluated on European and US cohorts from large…
Concordance based Survival Cobra with regression type weak learners
In this paper, we predict conditional survival functions through a combined regression strategy. We take weak learners as different random survival trees. We propose to maximize concordance in the right-censored set up t…
regressionVocal Bursts Type PredictionTight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance
We consider the classical problem of sequential probability assignment under logarithmic loss while competing against an arbitrary, potentially nonparametric class of experts. We obtain tight bounds on the minimax regret…