Learning Flexible Features for Conditional Random Fields.
Lists
Only you see this
Abstract
Extending traditional models for discriminative labeling of structured data to include higher-order structure in the labels results in an undesirable exponential increase in model complexity. In this paper, we present a model that is capable of learning such structures using a random field of parameterized features. These features can be functions of arbitrary combinations of observations, labels and auxiliary hidden variables. We also present a simple induction scheme to learn these features, which can automatically determine the complexity needed for a given data set. We apply the model to two real-world tasks, information extraction and image labeling, and compare our results to several other methods for discriminative labeling.
BibTeX
@article{stewart2008learning,
author = {Liam Stewart and Xuming He and Richard S. Zemel},
title = {{Learning Flexible Features for Conditional Random Fields.}},
journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
year = {2008},
url = {https://openreview.net/forum?id=roLEn8Elu6S},
}Loading related content...