10-601 Sequences
From Cohen Courses
Revision as of 16:08, 10 November 2013 by Wcohen (talk | contribs) (Created page with "This a lecture used in the Syllabus for Machine Learning 10-601 === Slides === * [http://www.cs.cmu.edu/~wcohen/10-601/hmms.pptx Slides in PowerPoint]. === Readings ===...")
This a lecture used in the Syllabus for Machine Learning 10-601
Slides
Readings
- This is not covered in Mitchell. There is a general introduction to CRFs by Sutton and McCallum. The most-used introduction to HMMs is: Rabiner, Lawrence R. "A tutorial on hidden Markov models and selected applications in speech recognition." Proceedings of the IEEE 77.2 (1989): 257-286.
Summary
You should know:
- The definition of an HMM
- What the Viterbi and forward-background algorithms are:
- What their complexity is
- What they compute.
- How to learn the parameters HMMs when
- The states associated with the training data are observed
- The states are unobserved.
- What the advantages of a CRF are compared to an HMM.
- How HMMs and CRFs relate to naive Bayes, logistic regression, and generative and discriminative models.
- How HMMs or CRFs can be used for named-entity recognition (NER) and other sequential classification tasks.
