ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Ensemble Naive Bayes×Boosting×Naive Bayes×
PodručjeStrojno učenjeStrojno učenjeStrojno učenje
ObiteljMachine learningMachine learningMachine learning
Godina nastanka2000s1990–19971997
TvoracVarious (Dietterich, T.G.; Webb, G.I.; others)Schapire, R. E.; Freund, Y.Mitchell, T. M. (textbook treatment)
VrstaEnsemble of probabilistic classifiersSequential ensemble (iterative reweighting)Probabilistic classifier (Bayes' theorem with conditional independence)
Temeljni izvorDietterich, T. G. (2000). Ensemble Methods in Machine Learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems (MCS 2000), Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer. DOI ↗Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072
Drugi naziviBagged Naive Bayes, Boosted Naive Bayes, Naive Bayes ensemble, NB ensembleAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleNaive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes
Srodne664
SažetakEnsemble Naive Bayes trains multiple Naive Bayes classifiers — each exposed to a different view of the data through bagging, feature subsets, or boosting — and combines their probabilistic predictions by voting or probability averaging. The approach retains the speed and interpretability of individual Naive Bayes models while reducing variance and improving accuracy through ensemble aggregation.Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.Naive Bayes is a fast probabilistic classifier that applies Bayes' theorem while assuming that the features are conditionally independent given the class — a method given its standard machine-learning treatment in Tom Mitchell's 1997 textbook Machine Learning. Despite this simplifying ('naive') assumption, it is quick to train and often surprisingly accurate.
ScholarGateSkup podataka
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Ensemble Naive Bayes · Boosting · Naive Bayes. Preuzeto 2026-06-19 s https://scholargate.app/hr/compare