Training conditional random fields via gradient tree boosting Public Deposited

http://ir.library.oregonstate.edu/concern/defaults/41687j53g

To appear, International Conference on Machine Learning, 2004

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such applications as part-of-speech tagging, text-to-speech mapping, protein and DNA sequence analysis, and information extraction from web pages. However, existing learning algorithms are slow, particularly in problems with large numbers of potential input features. This paper describes a new method for training CRFs by applying Friedman’s (1999) gradient tree boosting method. In tree boosting, the CRF potential functions are represented as weighted sums of regression trees. Regression trees are learned by stage-wise optimizations similar to Adaboost, but with the objective of maximizing the conditional likelihood P(Y|X) of the CRF model. By growing regression trees, interactions among features are introduced only as needed, so although the parameter space is potentially immense, the search algorithm does not explicitly consider the large space. As a result, gradient tree boosting scales linearly in the order of the Markov model and in the order of the feature interactions, rather than exponentially like previous algorithms based on iterative scaling and gradient descent.
Resource Type
Date Available
Date Issued
Rights Statement
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Michael Boock(michael.boock@oregonstate.edu) on 2012-08-31T17:02:08Z (GMT) No. of bitstreams: 1 2004-24.pdf: 179521 bytes, checksum: 7059c584962ae39b1edaceb24b1d40e1 (MD5)
  • description.provenance : Made available in DSpace on 2012-08-31T17:02:08Z (GMT). No. of bitstreams: 1 2004-24.pdf: 179521 bytes, checksum: 7059c584962ae39b1edaceb24b1d40e1 (MD5) Previous issue date: 2004
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-08-08T18:24:21Z No. of bitstreams: 1 2004-24.pdf: 179521 bytes, checksum: 7059c584962ae39b1edaceb24b1d40e1 (MD5)

Relationships

In Administrative Set:
Last modified: 07/18/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items