مقایسهٔ روش‌ها

	تی-اس‌ان‌ای (t-SNE)	مدل آمیخته گوسی	تحلیل مؤلفه‌های اصلی	SHAP (SHapley Additive exPlanations)
حوزه	یادگیری ماشین	یادگیری ماشین	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning	Machine learning	Machine learning
سال پیدایش	2008	1977	2002	2017
پدیدآور	van der Maaten, L. & Hinton, G.	Dempster, Laird & Rubin (EM algorithm)	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)	Lundberg, S.M. & Lee, S.-I.
نوع	Nonlinear dimensionality reduction (manifold visualization)	Probabilistic (soft) clustering — mixture model	Unsupervised dimensionality reduction	Model-explanation method (Shapley-value attribution)
منبع بنیادین	van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605.	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.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.	Lundberg, S.M. & Lee, S.-I. (2017). A Unified Approach to Interpreting Model Predictions. Advances in Neural Information Processing Systems, 30, 4766–4777.
نام‌های دیگر	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	Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform	SHAP Değerleri (Model Açıklanabilirlik), Shapley additive explanations, SHAP values, model explainability
مرتبط	3	4	3	5
خلاصه	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.	Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures.	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).