Please use this identifier to cite or link to this item:
|Title:||Conditional random fields with high-order features for sequence labeling||Authors:||Ye, N.
|Issue Date:||2009||Citation:||Ye, N.,Lee, W.S.,Chieu, H.L.,Wu, D. (2009). Conditional random fields with high-order features for sequence labeling. Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference : 2196-2204. ScholarBank@NUS Repository.||Abstract:||Dependencies among neighbouring labels in a sequence is an important source of information for sequence labeling problems. However, only dependencies between adjacent labels 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 show that it is possible to design efficient inference algorithms for a conditional random field using features that depend on long consecutive label sequences (high-order features), as long as the number of distinct label sequences used in the features is small. This leads to efficient learning algorithms for these conditional random fields. We show experimentally that exploiting dependencies using high-order features can lead to substantial performance improvements for some problems and discuss conditions under which high-order features can be effective.||Source Title:||Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference||URI:||http://scholarbank.nus.edu.sg/handle/10635/41608||ISBN:||9781615679119|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.