Stacked sequential learning write up

From Cohen Courses
Revision as of 16:21, 7 September 2010 by WikiAdmin (talk | contribs) (1 revision: trying again...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

This is a review of Cohen_2005_stacked_sequential_learning by user:sgopal1

  • The complexity would still be O(K). Assuming that K is not very small ( in that case the number of features to Naive Bayes will increase linearly with K ) it will approximately incur 10 times more cost to train. This is excluding the time taken to build the original classifier without augmenting the label features.