Optimizing F-Measures by Cost-Sensitive Classification
We present a theoretical analysis of F-measures for binary, multiclass and multilabel classification. These performance measures are non-linear, but in many scenarios they are pseudo-linear functions of the per-class false negative/false positive rate. Based on this observation, we present a general reduction of F-measure maximization to cost-sensitive classification with unknown costs. We then propose an algorithm with provable guarantees to obtain an approximately optimal classifier for the F-measure by solving a series of cost-sensitive classification problems. The strength of our analysis is to be valid on any dataset and any class of classifiers, extending the existing theoretical results on F-measures, which are asymptotic in nature. We present numerical experiments to illustrate the relative importance of cost asymmetry and thresholding when learning linear classifiers on various F-measure optimization tasks.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral ClassificationvalidSimilar Papers 제목 키워드 기반
The foundations of cost-sensitive causal classification
Classification is a well-studied machine learning task which concerns the assignment of instances to a set of outcomes. Classification models support the optimization of managerial decision-making across a variety of ope…
ClassificationDecision MakingGeneral ClassificationCost-Sensitive Feature Selection by Optimizing F-Measures
Feature selection is beneficial for improving the performance of general machine learning tasks by extracting an informative subset from the high-dimensional features. Conventional feature selection methods usually ignor…
feature selectionTheory of Optimizing Pseudolinear Performance Measures: Application to F-measure
Non-linear performance measures are widely used for the evaluation of learning algorithms. For example, $F$-measure is a commonly used performance measure for classification problems in machine learning and information r…
ClassificationGeneral ClassificationInformation RetrievalRetrieval+1The cost of fairness in classification
We study the problem of learning classifiers with a fairness constraint, with three main contributions towards the goal of quantifying the problem's inherent tradeoffs. First, we relate two existing fairness measures to …
ClassificationFairnessGeneral ClassificationCost-Sensitive Hierarchical Classification through Layer-wise Abstentions
We study the problem of cost-sensitive hierarchical classification where a label taxonomy has a cost-sensitive loss associated with it, which represents the cost of (wrong) predictions at different levels of the hierarch…
Classification