Σύγκριση μεθόδων

	Σύνολο Naive Bayes	Σύνολο Ψηφοφορίας (Voting Ensemble)
Πεδίο	Μηχανική Μάθηση	Μηχανική Μάθηση
Οικογένεια	Machine learning	Machine learning
Έτος προέλευσης	2000s	1990s–2004
Δημιουργός	Various (Dietterich, T.G.; Webb, G.I.; others)	Lam & Suen; Kuncheva, L. I. (systematic treatment)
Τύπος	Ensemble of probabilistic classifiers	Ensemble (combination of multiple classifiers by vote)
Θεμελιώδης πηγή	Dietterich, 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.	Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
Εναλλακτικές ονομασίες	Bagged Naive Bayes, Boosted Naive Bayes, Naive Bayes ensemble, NB ensemble	majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble
Συναφείς	6	5
Σύνοψη	Ensemble 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.	A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted.