Difference between revisions of "Stacked sequential learning write up"
From Cohen Courses
Jump to navigationJump to searchm (1 revision: trying again...) |
|
(No difference)
|
Latest revision as of 16:21, 7 September 2010
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.