השוואת שיטות

	מודל תערובת גאוסיאנית	יער אקראי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1977	2001
הוגה השיטה	Dempster, Laird & Rubin (EM algorithm)	Breiman, L.
סוג	Probabilistic (soft) clustering — mixture model	Ensemble (bagging of decision trees)
מקור מכונן	Dempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–22.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
כינויים	Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	4	4
תקציר	A Gaussian Mixture Model is a probabilistic clustering method that models the data as a weighted mixture of several Gaussian distributions, fitted with the Expectation–Maximization algorithm formalized by Dempster, Laird & Rubin in 1977. It is a generalization of K-means in which each cluster can take its own shape, size, and orientation.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.