Roth and Yih, ICML 2005. Integer Linear Programming Inference for Conditional Random Fields

From Cohen Courses
Revision as of 17:44, 30 October 2011 by Mridulg (talk | contribs) (→‎Summary)
Jump to navigationJump to search

Citation

Dan Roth and Wen-tau Yih. 2005. Integer Linear Programming Inference for Conditional Random Fields. In Proceedings of the 22^nd International Conference on Machine learning, ICML'05, New York, NY, USA.


Online Version

Online version

Summary

This paper presents an alternative approach to inference in conditional random fields using integer linear programming (ILP). The standard Viterbi algorithm based on dynamic programming, in general, cannot efficiently incorporate non-local and non-sequential constraints over the output sequence. The authors propose an ILP-based method to inference procedure. and extend CRF models to naturally and efficiently support general constraint structures.

Method

Experiments and Results

Related Papers