TL;DR
This paper investigates classifier score calibration in binary classification, introducing multi-score calibration and feature expansion, supported by extensive simulations and real cybersecurity data, to improve probability estimates and comparability.
Contribution
It introduces multi-score calibration and the idea of expanding scores to higher dimensions, enhancing calibration performance over traditional methods.
Findings
Platt's calibrator shows stable, acceptable performance.
Multi-score calibration often outperforms single-score methods.
Expanding scores to higher dimensions can improve calibration in some cases.
Abstract
This paper explores the calibration of a classifier output score in binary classification problems. A calibrator is a function that maps the arbitrary classifier score, of a testing observation, onto to provide an estimate for the posterior probability of belonging to one of the two classes. Calibration is important for two reasons; first, it provides a meaningful score, that is the posterior probability; second, it puts the scores of different classifiers on the same scale for comparable interpretation. The paper presents three main contributions: (1) Introducing multi-score calibration, when more than one classifier provides a score for a single observation. (2) Introducing the idea that the classifier scores to a calibration process are nothing but features to a classifier, hence proposing expanding the classifier scores to higher dimensions to boost the calibrator's…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSupport Vector Machine · Logistic Regression
