השוואת שיטות

	מודל תערובת גאוסיאנית אנסמבל	בוסטינג
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2000s	1990–1997
הוגה השיטה	Combination of GMM (Dempster et al., 1977) and ensemble learning (Dietterich, 2000)	Schapire, R. E.; Freund, Y.
סוג	Ensemble of probabilistic generative models	Sequential ensemble (iterative reweighting)
מקור מכונן	Bishop, C. M. (2006). Pattern Recognition and Machine Learning (Ch. 9: Mixture Models and EM). Springer. ISBN: 978-0-387-31073-2	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.
כינויים	E-GMM, GMM ensemble, mixture model ensemble, ensemble GMM	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
קשורות	4	6
תקציר	Ensemble Gaussian Mixture Model (E-GMM) combines multiple independently fitted Gaussian Mixture Models to improve density estimation, clustering stability, and anomaly detection. By averaging or aggregating the probabilistic outputs of several GMMs — each trained on a different data subset or random initialization — the ensemble reduces sensitivity to local optima and random seed choice, yielding more robust and reliable results than any single GMM.	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.