ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

Bagging (Bootstrap Aggregating)×Boosting×Naive Bayes×
ÁreaAprendizado de máquinaAprendizado de máquinaAprendizado de máquina
FamíliaMachine learningMachine learningMachine learning
Ano de origem19961990–19971997
Autor originalBreiman, L.Schapire, R. E.; Freund, Y.Mitchell, T. M. (textbook treatment)
TipoEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)Probabilistic classifier (Bayes' theorem with conditional independence)
Fonte seminalBreiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. 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
Outros nomesBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleNaive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes
Relacionados564
ResumoBagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.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.
ScholarGateConjunto de dados
  1. v1
  2. 3 Fontes
  3. PUBLISHED
  1. v1
  2. 2 Fontes
  3. PUBLISHED
  1. v1
  2. 1 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: Bagging · Boosting · Naive Bayes. Recuperado em 2026-06-19 de https://scholargate.app/pt/compare