ScholarGate
Asistent

Porovnať metódy

Prezrite si vybrané metódy vedľa seba; riadky, ktoré sa líšia, sú zvýraznené.

Bagging (Bootstrap Aggregating)×Boosting×K-Means Clustering×
OdborStrojové učenieStrojové učenieStrojové učenie
RodinaMachine learningMachine learningMachine learning
Rok vzniku19961990–19971967
TvorcaBreiman, L.Schapire, R. E.; Freund, Y.MacQueen, J.
TypEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)Partitional clustering (centroid-based)
Pôvodný zdrojBreiman, 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 ↗MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗
Ďalšie názvyBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleK-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
Príbuzné563
ZhrnutieBagging, 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.K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.
ScholarGateDátová sada
  1. v1
  2. 3 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 1 Zdroje
  3. PUBLISHED

Prejsť na hľadanie Stiahnuť snímky

ScholarGatePorovnať metódy: Bagging · Boosting · K-Means Clustering. Získané 2026-06-19 z https://scholargate.app/sk/compare