Approximate parameter learning in conditional random fields: An empirical investigation

7Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the parameter likelihood gradient. We show, as opposed to [1][2], that these parameter learning methods can be improved and evaluate the resulting performance employing different inference techniques. We show that the approximation based on penalized pseudo-likelihood (PPL) in combination with the Maximum A Posteriori (MAP) inference yields results comparable to other state of the art approaches, while providing advantages to formulating parameter learning as a convex optimization problem. Eventually, we demonstrate applicability on the task of detecting man-made structures in natural images. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Korč, F., & Förstner, W. (2008). Approximate parameter learning in conditional random fields: An empirical investigation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5096 LNCS, pp. 11–20). https://doi.org/10.1007/978-3-540-69321-5_2

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