Efficient F measure maximization via weighted maximum likelihood

5Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The classification models obtained via maximum likelihood-based training do not necessarily reach the optimal Fβ-measure for some user’s choice of β that is achievable with the chosen parametrization. In this work we link the weighted maximum entropy and the optimization of the expected Fβ-measure, by viewing them in the framework of a general common multi-criteria optimization problem. As a result, each solution of the expected Fβ-measure maximization can be realized as a weighted maximum likelihood solution within the maximum entropy model - a well understood and behaved problem for which standard (off the shelf) gradient methods can be used. Based on this insight, we present an efficient algorithm for optimization of the expected Fβ using weighted maximum likelihood with dynamically adaptive weights.

Cite

CITATION STYLE

APA

Dimitroff, G., Georgiev, G., Toloşi, L., & Popov, B. (2015). Efficient F measure maximization via weighted maximum likelihood. Machine Learning, 98(3), 435–454. https://doi.org/10.1007/s10994-014-5439-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free