A naive Bayes classifier is a member of a family of probabilistic classifiers that assign a class label to an observation by applying Bayes' theorem while assuming every feature is conditionally independent of every other feature given the class, an assumption that gives the method its name because it rarely holds exactly in real data. Despite this unrealistic independence assumption, naive Bayes classifiers train quickly through closed-form probability estimates rather than expensive iterative optimization, and remain competitive for tasks such as spam filtering and document classification. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Partially Attested
Time ComplexityTheta(|C||V|) to compute parameters (multinomial naive Bayes, text classification) 2 Figure is for multinomial naive Bayes applied to text classification, not stated for naive Bayes in general Time Complexity
Time Complexity (category) Sources
1. Naive Bayes Classifier Algorithm (Wikipedia)
Wikipedia infobox: time complexity linearQuote, Wikipedia infobox: time complexity linear
linear
View the Source 2. Stanford IR Book: Naive Bayes text classification
What is the time complexity of NB?Quote, What is the time complexity of NB?
The complexity of computing the parameters is ╬ÿ(|C||V|)
View the Source Wikipedia: Naive Bayes Classifier Algorithm
Wikimedia FoundationLead sectionQuote, Lead section
In statistics, naive (sometimes simple or idiot's) Bayes classifiers are a family of probabilistic classifiers which assume that the features are conditionally independent, given the target class.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.