Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| t-SNE× | Gaussovský směsný model× | SHAP (SHapley Additive exPlanations)× | |
|---|---|---|---|
| Obor | Strojové učení | Strojové učení | Strojové učení |
| Rodina | Machine learning | Machine learning | Machine learning |
| Rok vzniku≠ | 2008 | 1977 | 2017 |
| Tvůrce≠ | van der Maaten, L. & Hinton, G. | Dempster, Laird & Rubin (EM algorithm) | Lundberg, S.M. & Lee, S.-I. |
| Typ≠ | Nonlinear dimensionality reduction (manifold visualization) | Probabilistic (soft) clustering — mixture model | Model-explanation method (Shapley-value attribution) |
| Původní zdroj≠ | van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605. link ↗ | 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 ↗ |
| Další názvy≠ | t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne | 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 |
| Příbuzné≠ | 3 | 4 | 5 |
| Shrnutí≠ | t-SNE (t-Distributed Stochastic Neighbor Embedding) is a nonlinear dimensionality-reduction method introduced by Laurens van der Maaten and Geoffrey Hinton in 2008 that maps high-dimensional data into a 2D or 3D space for visualization. It preserves probabilistic local similarities, so points that are neighbours in the original space stay close together, revealing cluster structure and local neighbourhoods. | 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). |
| ScholarGateDatová sada ↗ |
|
|
|