Title
Conditional random field with high-order dependencies for sequence labeling and segmentation.
Abstract
Dependencies among neighboring labels in a sequence are important sources of information for sequence labeling and segmentation. However, only first-order dependencies, which are dependencies between adjacent labels or segments, are commonly exploited in practice because of the high computational complexity of typical inference algorithms when longer distance dependencies are taken into account. In this paper, we give efficient inference algorithms to handle high-order dependencies between labels or segments in conditional random fields, under the assumption that the number of distinct label patterns used in the features is small. This leads to efficient learning algorithms for these conditional random fields. We show experimentally that exploiting high-order dependencies can lead to substantial performance improvements for some problems, and we discuss conditions under which high-order features can be effective.
Year
DOI
Venue
2014
10.5555/2627435.2638567
Journal of Machine Learning Research
Keywords
Field
DocType
conditional random field,semi-Markov conditional random field,high-order feature,sequence labeling,segmentation,label sparsity
Conditional random field,Sequence labeling,Pattern recognition,Inference,Computer science,Segmentation,Artificial intelligence,Machine learning,Computational complexity theory
Journal
Volume
Issue
ISSN
15
1
1532-4435
Citations 
PageRank 
References 
13
0.81
25
Authors
4
Name
Order
Citations
PageRank
Viet Cuong Nguyen1213.03
Nan Ye214912.60
Wee Sun Lee33325382.37
hai leong chieu476051.41