ScholarGate
Assistente

Comparar métodos

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

Bagging (Bootstrap Aggregating)×Boosting×Aprendizagem Federada×
ÁreaAprendizado de máquinaAprendizado de máquinaPrivacidade
FamíliaMachine learningMachine learningMachine learning
Ano de origem19961990–19972017
Autor originalBreiman, L.Schapire, R. E.; Freund, Y.McMahan et al.
TipoEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)Distributed privacy-preserving machine learning
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 ↗McMahan, B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. (2017). Communication-efficient learning of deep networks from decentralized data. Artificial Intelligence and Statistics, 1273–1282. link ↗
Outros nomesBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleCollaborative Learning, Decentralized Learning, FedAvg, Federe Öğrenme
Relacionados563
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.Federated Learning is a distributed machine learning paradigm introduced by McMahan et al. in 2017 in which a global model is trained collaboratively across multiple decentralized clients — such as mobile devices or hospital systems — without ever transferring raw data to a central server. Each participant computes model updates locally using its private data; only those updates, not the underlying data, are communicated and aggregated by the server to improve the shared model.
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 · Federated Learning. Recuperado em 2026-06-18 de https://scholargate.app/pt/compare