0Pricing
Machine Learning Academy · Ders

SHAP Değerleri: Küresel ve Yerel Özellik Önem Düzeyi

Öğrenenler, gradyan artırmalı bir model için SHAP değerlerini hesaplayacak, arı ve çubuk özet grafiklerini oluşturacak ve tek bir tahmini teknik bilgisi olmayan bir paydaşa açıklayacaklardır.

SHAP Değerleri: Küresel ve Yerel Özellik Önem Düzeyi, CoddyKit'te ücretsiz bir Machine Learning Academy dersidir. Bu, 4 dersinin 1. dersidir. Aşağıdan dersin tamamını ücretsiz okuyabilir, sonra tarayıcıda yerleşik kod editörü ve 7/24 yapay zeka koçu ile uygulamalı olarak pratik yapabilirsin. Bu, Machine Learning Academy öğrenme yolunun bir parçasıdır ve ilerlemeniz web ve CoddyKit uygulaması arasında senkronize olur. Machine Learning Academy kursu toplamda 4 dersten oluşur.

Bu dersin bazı bölümleri henüz çevrilmemiş olup İngilizce olarak gösterilmektedir.

Why Model Explainability Matters

Explainability is the ability to understand why a model made a specific prediction. In high-stakes domains like lending, healthcare, and hiring, regulators and users demand explanations — not just accurate predictions. SHAP (SHapley Additive exPlanations) provides a mathematically principled framework rooted in cooperative game theory to deliver these explanations for any model.

Shapley Values: The Game Theory Origin

SHAP values borrow from Shapley values in cooperative game theory, where players (features) collaborate to produce an outcome (prediction). Each feature receives a fair share of credit by averaging its marginal contribution across all possible feature orderings. This makes SHAP the only additive attribution method satisfying the axioms of efficiency, symmetry, dummy, and additivity.

Installing and Importing SHAP

The shap library supports tree models, neural networks, and any black-box model. Install it with pip install shap and import it alongside your trained model. SHAP's explainers are model-type-aware: TreeExplainer for gradient boosting and random forests gives exact values in O(T·D²) time, far faster than the naive exponential-time Shapley computation.

import shap
import xgboost as xgb
from sklearn.datasets import load_breast_cancer
from sklearn.model_selection import train_test_split

data = load_breast_cancer()
X_train, X_test, y_train, y_test = train_test_split(
    data.data, data.target, test_size=0.2, random_state=42
)

model = xgb.XGBClassifier(n_estimators=100, use_label_encoder=False, eval_metric='logloss')
model.fit(X_train, y_train)

explainer = shap.TreeExplainer(model)

Computing SHAP Values for the Test Set

Call explainer.shap_values(X_test) to produce a matrix where each row is a sample and each column is a feature. The SHAP value for feature j in sample i represents the contribution of feature j to pushing the prediction away from the expected base value. Positive values push toward the positive class; negative values push toward the negative class.

shap_values = explainer.shap_values(X_test)

print('SHAP values shape:', shap_values.shape)  # (n_samples, n_features)
print('Base value (expected prediction):', explainer.expected_value)
print('First sample SHAP values:', shap_values[0])

Global Importance: Bar Plot

Global feature importance summarises which features matter most across all predictions. The SHAP summary_plot in bar mode shows the mean absolute SHAP value per feature, ranking them from most to least important. This replaces the naive built-in feature importance that only counts split counts, which is biased toward high-cardinality features.

import matplotlib.pyplot as plt

# Bar plot: mean |SHAP| per feature
shap.summary_plot(shap_values, X_test,
                  feature_names=data.feature_names,
                  plot_type='bar')
plt.tight_layout()
plt.savefig('shap_bar.png', dpi=150)

Global Importance: Beeswarm Plot

The beeswarm plot (default summary_plot) is richer than a bar chart: each dot represents one sample, coloured by feature value (red = high, blue = low). The x-axis shows the SHAP value, so you can see not only which features matter but also in which direction a high or low feature value pushes predictions. This reveals nonlinear and interaction effects at a glance.

shap.summary_plot(shap_values, X_test,
                  feature_names=data.feature_names)
# Dots to the right = positive contribution to predicted class
# Red dots far right = high feature value strongly increases prediction

Local Explanation: Force Plot

A force plot explains a single prediction. It shows the base value on the left and the final prediction on the right, with features as arrows that push the output higher (red) or lower (blue). The width of each arrow is proportional to the feature's SHAP value. This is the explanation you would show a loan officer asking 'why was this application denied?'

# Explain the first test sample
i = 0
shap.force_plot(
    explainer.expected_value,
    shap_values[i],
    X_test[i],
    feature_names=data.feature_names,
    matplotlib=True
)

Local Explanation: Waterfall Plot

The waterfall plot is a cleaner alternative to the force plot for a single sample. It stacks SHAP contributions vertically from the base value, showing each feature's contribution as a bar segment. Positive contributions are red and push toward the top; negative contributions are blue and pull down. The final stack total equals the model's raw output for that sample.

import shap

explanation = shap.Explanation(
    values=shap_values[0],
    base_values=explainer.expected_value,
    data=X_test[0],
    feature_names=list(data.feature_names)
)
shap.waterfall_plot(explanation)

Dependence Plot: Feature Interactions

A SHAP dependence plot shows how a single feature's SHAP value changes as its raw value changes, coloured by a second feature to reveal interactions. For example, plotting 'worst radius' coloured by 'mean texture' reveals whether the effect of radius depends on texture. This goes beyond ordinary partial-dependence plots by accounting for all feature interactions naturally.

shap.dependence_plot(
    'worst radius',          # feature to plot on x-axis
    shap_values,
    X_test,
    feature_names=list(data.feature_names),
    interaction_index='mean texture'  # colour by this feature
)

SHAP with Any Model: KernelExplainer

When the model is a black box (SVM, neural network, any sklearn estimator), use shap.KernelExplainer, which approximates Shapley values by sampling coalitions and fitting a weighted linear model locally. It is model-agnostic but slower than TreeExplainer. Provide a background dataset summary (e.g., K-Means centroids) to speed up computation on large datasets.

from sklearn.svm import SVC
from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
import shap
import numpy as np

pipeline = Pipeline([('scaler', StandardScaler()), ('svm', SVC(probability=True))])
pipeline.fit(X_train, y_train)

# Use 50 background samples for speed
background = shap.kmeans(X_train, 50)
explainer_k = shap.KernelExplainer(pipeline.predict_proba, background)
shap_vals_k = explainer_k.shap_values(X_test[:10])  # Explain 10 samples

Validation: SHAP Values Sum to Prediction

A key property of SHAP is efficiency: the sum of all SHAP values for a sample plus the base value must equal the model's raw output. Verifying this sanity check confirms the explainer is working correctly. Any discrepancy indicates a mismatch between the explainer type and the model, or incorrect background data.

import numpy as np

# For tree models, verify SHAP values sum to log-odds output
base = explainer.expected_value
for i in range(5):
    shap_sum = shap_values[i].sum() + base
    raw_pred = model.predict(X_test[i:i+1], output_margin=True)[0]
    print(f'Sample {i}: SHAP sum={shap_sum:.4f}, model output={raw_pred:.4f}, match={abs(shap_sum-raw_pred)<1e-4}')

Quick Check

Test your understanding of Machine Learning with Python concepts from this lesson.

Lesson Recap

In this lesson you learned: SHAP values quantify each feature's contribution to a prediction using Shapley values from game theory, global summaries (bar and beeswarm plots) reveal overall feature importance and direction, and local explanations (force and waterfall plots) justify individual predictions. Next up we explore LIME as an alternative model-agnostic explanation approach.

Sıkça Sorulan Sorular

“SHAP Değerleri: Küresel ve Yerel Özellik Önem Düzeyi” dersi ücretsiz mi?

Evet — “SHAP Değerleri: Küresel ve Yerel Özellik Önem Düzeyi” dersin tüm metni burada web'de ücretsiz olarak okunabilir. Etkileşimli olarak pratik yapmak (yerleşik kod editörü ve 7/24 yapay zeka koçu) ve Machine Learning Academy kursunun geri kalanını açmak için CoddyKit PRO'ya yükselt. Machine Learning Academy kursu toplamda 4 dersten oluşur.

“SHAP Değerleri: Küresel ve Yerel Özellik Önem Düzeyi” dersinde ne öğreneceğim?

Öğrenenler, gradyan artırmalı bir model için SHAP değerlerini hesaplayacak, arı ve çubuk özet grafiklerini oluşturacak ve tek bir tahmini teknik bilgisi olmayan bir paydaşa açıklayacaklardır. Machine Learning Academy ile uygulamalı kodu tarayıcıda doğrudan çalıştırarak pratik yaparsın ve 7/24 yapay zeka koçu dersi çalışırken sorularını yanıtlar.

Machine Learning Academy öğrenmeye başlamak için deneyim gerekli mi?

Önceden deneyim gerekmez. CoddyKit'te Machine Learning Academy, başlangıçtan ileri seviyeye kadar yapılandırıldığı için buradan başlayabilir veya başından başlayıp kendi hızında ilerleme yapabilirsin. Bu, 4 dersinin 1. dersidir.

“SHAP Değerleri: Küresel ve Yerel Özellik Önem Düzeyi” dersi ne kadar sürer?

Çoğu CoddyKit dersi yaklaşık 5–10 dakika sürer. Her biri kısa ve etkileşimli olduğu için sabit ilerleme yaparsın ve web ile uygulama arasında tam olarak bıraktığın yerden devam edebilirsin.

Bu Machine Learning Academy dersinde kod yazıp çalıştırabilir miyim?

Evet. Her Machine Learning Academy dersi yerleşik bir kod editörü içerir, bu sayede tarayıcıda gerçek kod yazıp çalıştırabilir ve anlık yapay zeka geri bildirimi alırsın — yerel kurulum gerekli değildir.

Bu kursun tüm dersleri

  1. SHAP Değerleri: Küresel ve Yerel Özellik Önem Düzeyi
  2. LIME: Yerel, Yorumlanabilir ve Modelden Bağımsız Açıklamalar
  3. Adillik Ölçütleri: Demografik Eşlik ve Eşit Fırsat
  4. Yanlılığı Azaltma Stratejileri: Ön İşleme, İşleme Sırasında ve Son İşleme
← Machine Learning Academy Sayfasına Dön