Difference between revisions of "Class Meeting for 10-710 09-08-2011"

From Cohen Courses
Jump to navigationJump to search
Line 16: Line 16:
 
=== Optional Readings ===
 
=== Optional Readings ===
  
* [http://www.binf.ku.dk/users/krogh/publications/pdf/Krogh94.pdf Hidden Markov Models for Labeled Sequences, Krogh 1994].  The method of this paper appears to be equivalent to linear-chain CRFs - so why didn't it catch on?
+
* [http://people.binf.ku.dk/~krogh/publications/pdf/Krogh94.pdf Hidden Markov Models for Labeled Sequences, Krogh 1994].  The method of this paper appears to be equivalent to linear-chain CRFs - so why didn't it catch on?
 
* [http://jmlr.csail.mit.edu/papers/volume9/dietterich08a/dietterich08a.pdf Gradient tree boosting for training CRFs, Dietterich et al, ICML 2004].  A very different training method for CRFs, based on regression trees.
 
* [http://jmlr.csail.mit.edu/papers/volume9/dietterich08a/dietterich08a.pdf Gradient tree boosting for training CRFs, Dietterich et al, ICML 2004].  A very different training method for CRFs, based on regression trees.
 
* [http://acl.ldc.upenn.edu/P/P06/P06-1027.pdf Semi-Supervised Conditional Random Fields for Improved Sequence Segmentation and Labeling, Jiao et al, ACL 2006].  A very nice paper from the UofA group on semi-supervised CRF learning.
 
* [http://acl.ldc.upenn.edu/P/P06/P06-1027.pdf Semi-Supervised Conditional Random Fields for Improved Sequence Segmentation and Labeling, Jiao et al, ACL 2006].  A very nice paper from the UofA group on semi-supervised CRF learning.

Revision as of 11:13, 8 September 2011

This is one of the class meetings on the schedule for the course Syllabus for Structured Prediction 10-210 in Fall 2011.

Linear-chain CRFs

Required Readings

I will also cover most of the material in the paper below in lecture. This paper defines CRFs somewhat more generally than Sha & Pereira do.

Optional Readings

Background