Difference between revisions of "Conditional Random Fields"
PastStudents (talk | contribs) |
PastStudents (talk | contribs) |
||
| Line 1: | Line 1: | ||
This is a [[category::method]] discussed in [[Information Extraction 10-707 in Fall 2010]]. | This is a [[category::method]] discussed in [[Information Extraction 10-707 in Fall 2010]]. | ||
| + | |||
| + | == Linear-chain Conditional Random Fields == | ||
| + | The paper focuses on conditional random fields on sequences. Such CRFs define conditional probability distributions p(Y|X) of label sequences given input sequences. The label and input sequences are assumed to have the same length. | ||
| + | |||
| + | A CRF on (X, Y) is specified by a local feature vector and a weight vector, the local features are defined as follows: | ||
| + | |||
| + | [[File:p1.png]] | ||
| + | |||
| + | And the global feature vector is thus an aggregate of the local features: | ||
| + | |||
| + | [[File:p2.png]] | ||
| + | |||
| + | The conditional probability distribution defined by CRF is then defined as | ||
| + | |||
| + | [[File:p3.png]] | ||
| + | |||
| + | In sequential labeling task, we would like to find the most probable label sequence for input sequence, thus we use the following formula | ||
| + | |||
| + | [[File:p4.png]] | ||
| + | |||
| + | The decoding process can be done with the Viterbi algorithm. | ||
| + | |||
== Relevant Papers == | == Relevant Papers == | ||
Revision as of 23:00, 30 November 2010
This is a method discussed in Information Extraction 10-707 in Fall 2010.
Linear-chain Conditional Random Fields
The paper focuses on conditional random fields on sequences. Such CRFs define conditional probability distributions p(Y|X) of label sequences given input sequences. The label and input sequences are assumed to have the same length.
A CRF on (X, Y) is specified by a local feature vector and a weight vector, the local features are defined as follows:
And the global feature vector is thus an aggregate of the local features:
The conditional probability distribution defined by CRF is then defined as
In sequential labeling task, we would like to find the most probable label sequence for input sequence, thus we use the following formula
The decoding process can be done with the Viterbi algorithm.
