Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Modello di Miscela Gaussiana× | SHAP (SHapley Additive exPlanations)× | |
|---|---|---|
| Campo | Apprendimento automatico | Apprendimento automatico |
| Famiglia | Machine learning | Machine learning |
| Anno di origine≠ | 1977 | 2017 |
| Ideatore≠ | Dempster, Laird & Rubin (EM algorithm) | Lundberg, S.M. & Lee, S.-I. |
| Tipo≠ | Probabilistic (soft) clustering — mixture model | Model-explanation method (Shapley-value attribution) |
| Fonte seminale≠ | 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. DOI ↗ | Lundberg, S.M. & Lee, S.-I. (2017). A Unified Approach to Interpreting Model Predictions. Advances in Neural Information Processing Systems, 30, 4766–4777. link ↗ |
| Alias≠ | Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians | SHAP Değerleri (Model Açıklanabilirlik), Shapley additive explanations, SHAP values, model explainability |
| Correlati≠ | 4 | 5 |
| Sintesi≠ | 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. | SHAP is a model-explanation method, introduced by Scott Lundberg and Su-In Lee in 2017, that uses Shapley values from cooperative game theory to measure how much each feature contributes to an individual prediction, making the output of black-box machine-learning models interpretable. It supports both global explanations (overall feature importance) and local explanations (why one specific prediction came out the way it did). |
| ScholarGateInsieme di dati ↗ |
|
|