Dynamic Conditional Random Fields: Factorized Probabilistic Models for Labeling and Segmenting Sequence Data

Authors

Charles Sutton, University of Massachusetts - Amherst
Khashayar Rohanimanesh, University of Massachusetts - Amherst
Andrew McCallum, University of Massachusetts - Amherst

Publication Date

2004

Abstract

In sequence modeling, we often wish to represent complex interaction between labels, such as when performing multiple, cascaded labeling tasks on the same sequence, or when longrange dependencies exist. We present dynamic conditional random fields (DCRFs), a generalization of linear-chain conditional random fields (CRFs) in which each time slice contains a set of state variables and edges—a distributed state representation as in dynamic Bayesian networks (DBNs)—and parameters are tied across slices. Since exact inference can be intractable in such models, we perform approximate inference using several schedules for belief propagation, including tree-based reparameterization (TRP). On a natural-language chunking task, we show that a DCRF performs better than a series of linearchain CRFs, achieving comparable performance using only half the training data.

Comments

This paper was harvested from CiteSeer

Recommended Citation

Sutton, Charles; Rohanimanesh, Khashayar; and McCallum, Andrew, "Dynamic Conditional Random Fields: Factorized Probabilistic Models for Labeling and Segmenting Sequence Data" (2004). Computer Science Department Faculty Publication Series. 63.
Retrieved from https://scholarworks.umass.edu/cs_faculty_pubs/63