View source for Liuliu writeup of Cohen and Carvalho

From Cohen Courses

← Liuliu writeup of Cohen and Carvalho

You do not have permission to edit this page, for the following reason:

---

You can view and copy the source of this page.

This is a review of [[reviewed paper::Cohen_2005_stacked_sequential_learning]] by [[reviewer::user:Liuliu]]. This paper is about using stacked sequential learning method to solve sequential partitioning tasks, which is a sequential classification task that characterized by long runs of identical labels. It is a meta learning method that works on both non-sequential based learners and sequential based learners. When it works on MEMM, it helps solve the mismatch problem of MEMM, which is that the MEMM model trained on training data doesn’t match the test data. Because the MEMM trained model gives higher weights to history features (labels of near nodes). However, these history features in the training data are true labels while in the testing data they are predicted ones. To make the training and testing consistent, stacking method also use the predicted labels as history features instead of true labels by cross-validation. Regarding the question about naive Bayes, it should be 12(10+2) times slower.

Return to Liuliu writeup of Cohen and Carvalho.