Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Naive Bayes: Time Complexity
Training Time: O(|D|Lave + |C||V|)) where Lave is the average length of a document in D.
Assumes all counts are pre-computed in O(|D|Lave) time during one pass through all of the data. ← Why ?
Generally just O(|D|Lave) since usually |C||V| < |D|Lave
Test Time: O(|C| Lt) where Lt is the average length of a test document.
Very efficient overall, linearly proportional to the time needed to just read in all the data.
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Quality
Sources
There are currently no sources for this slide.