Skip to content
v0.1.3latest release121 skills4 categories6 sub-categories247 tested scripts397 reference docsContact us

Metrics for Imbalanced Problems

Reference for imbalanced-class-handler · 69 lines

AI & Machine Learning / Classical Machine Learningv1.0.0Updated OCT 25 20264 references2 scripts

Why accuracy fails

At 2% prevalence "always negative" is 98% accurate and catches nothing. Any metric dominated by true negatives hides the minority class.

ROC vs PR

ROC-AUCPR-AUC (average precision)
Random baseline0.5prevalence (e.g. 0.02)
Sensitive to prevalencenoyes
Focuswhole rankingtop of the ranking (where decisions happen)
Good forcomparing rankers across datasetsrare-event decisions

A model can have ROC-AUC 0.95 and PR-AUC 0.2 at 0.5% prevalence: thousands of false positives per true one. Report both, decide on PR-AUC or the operating-point metric.

Operating-point metrics

python
import numpy as np
def at_k(y, s, k):
    idx = np.argsort(-s)[:k]
    tp = y[idx].sum()
    return {"precision@k": tp / k, "recall@k": tp / y.sum(), "lift@k": (tp / k) / y.mean()}

Expected cost at a threshold: (FP * C_fp + FN * C_fn) / n.

Few positives: confidence intervals

With 34 positives the standard error of recall is ~sqrt(r(1−r)/34): at r = 0.7 that is ±0.08 (one SE). Always attach intervals:

python
def bootstrap(y, s, metric, n=2000, seed=0):
    rng = np.random.default_rng(seed); out = []
    pos, neg = np.where(y == 1)[0], np.where(y == 0)[0]
    for _ in range(n):
        idx = np.concatenate([rng.choice(pos, len(pos)), rng.choice(neg, len(neg))])   # stratified resample
        out.append(metric(y[idx], s[idx]))
    return np.percentile(out, [2.5, 97.5])

Stratified bootstrap keeps the positive count fixed so intervals are not distorted by resamples with too few positives.

CV with few positives

  • StratifiedKFold so each fold has its share of positives.
  • RepeatedStratifiedKFold(n_splits=5, n_repeats=5) to average out fold noise.
  • Pool out-of-fold predictions (cross_val_predict) and compute PR-AUC once on all of them, in addition to per-fold means: per-fold PR-AUC with 7 positives is extremely noisy.

Multiclass with rare classes

  • Per-class precision/recall/F1 (classification_report).
  • Macro averages so rare classes count equally; weighted averages for frequency-weighted views.
  • One-vs-rest PR-AUC per class.
  • Confusion matrix normalised by true class (normalize="true").

Summary metrics that respect both classes

MetricNotes
Balanced accuracymean of TPR and TNR
MCCcorrelation between predictions and labels; robust single number
G-meansqrt(TPR x TNR)
F-betaweighs recall vs precision; ignores TN
More in Classical Machine Learning

anomaly-detection-model-builder

Build and evaluate anomaly detection for tabular, sensor and transaction data with few or no labels: define the anomaly type (point, contextual, collective), choose detectors (robust z-score/MAD and IQR rules, Mahalanobis with robust covariance, k-NN distance, LOF, Isolation Forest, one-class SVM, PCA reconstruction / autoencoders, forecasting residuals for time series), combine them by rank, explain each alert by its deviating features, set thresholds from an alert budget or the score distribution, and evaluate with precision@k, PR-AUC and recall on known incidents, or detector agreement when no labels exist. Includes pure-Python detectors (robust z, Mahalanobis, kNN, Isolation Forest, ensemble) and an evaluation script.

catboost-model-builder

Build CatBoost models that use its strengths correctly: raw categorical columns as cat_features (ordered target statistics, no manual encoding), text_features, Pool construction with NaN-safe categories, ordered boosting and has_time for temporal data, symmetric (oblivious) trees, overfitting detector with eval_set and use_best_model, losses for classification, regression (Quantile, Poisson, Tweedie) and ranking (YetiRank), class weights, monotone constraints, feature importance (PredictionValuesChange, LossFunctionChange) and SHAP values, GPU training and model export. Plans cat/text/numeric columns from a CSV and generates a runnable training script, and checks parameter sets for the conflicts CatBoost rejects (iterations vs n_estimators, Bayesian bootstrap with subsample, multiple class-weight options, depth > 16, use_best_model without eval_set).

categorical-encoding-selector

Choose and implement the right encoding for every categorical column given the model family and the data: one-hot (with infrequent-level grouping and handle_unknown), ordinal with an explicit order, cross-fitted target encoding (scikit-learn TargetEncoder, CatBoost ordered statistics, category_encoders inside CV), frequency/count encoding, feature hashing, native categorical support in LightGBM, HistGradientBoosting, XGBoost and CatBoost, prefix levels for codes (zip3, NAICS-2), and embeddings. Measures cardinality, rare-level share, unseen-level rate on a time-ordered holdout and target signal per column, emits the ColumnTransformer, and quantifies target-encoding leakage (in-sample vs out-of-fold vs holdout AUC).

classification-model-selector

Choose the right classification algorithm for tabular, text or mixed data and prove the choice with a fair bake-off: logistic regression (L2, L1, elastic net), linear SVM, naive Bayes, k-NN, RBF SVM, decision trees, random forest, extra trees, HistGradientBoosting, LightGBM, XGBoost, CatBoost, explainable boosting machines (EBM/GAM), points scorecards and MLPs, matched to data size, width, categorical and high-cardinality share, missingness, class imbalance, text, and constraints such as interpretability, monotonic constraints, calibrated probabilities, latency budgets and tiny deployable models. Ranks candidates with starting hyperparameters and cautions, then generates a bake-off script running every candidate on identical CV folds with per-fold metrics, fit time and prediction latency.

clustering-algorithm-selector

Choose the right clustering algorithm and check that clustering makes sense at all: cluster tendency (Hopkins statistic with a correlated-features caveat, nearest-neighbour isolation), then k-means / MiniBatchKMeans, Gaussian mixtures with BIC, agglomerative (Ward, average, complete, single) with dendrograms, DBSCAN, HDBSCAN, OPTICS, spectral clustering, BIRCH, mean shift, k-prototypes and k-modes for mixed or categorical data, and Gower distance, matched to data size, expected shapes, noise, varying density, known k, soft memberships, hierarchy and streaming. Covers preprocessing (scaling, encoding, dimensionality, distance metrics), validation (internal indices, bootstrap stability, external labels, business profiling) and assigning new points.

collaborative-filtering-implementer

Implement collaborative filtering recommenders that beat popularity: item-based kNN with cosine, Jaccard or asymmetric similarity, shrinkage, neighbourhood size, positive-only or mean-centred rating signals and 'because you liked X' explanations; implicit ALS with confidence weighting, BPR pairwise ranking and the closed-form EASE model in plain NumPy, tuned on a temporal validation split by recall@k and NDCG@k and refit on all data; plus user-kNN, explicit matrix factorisation, the implicit/LightFM libraries, hyperparameter ranges, cold-start fallbacks, scaling with sparse matrices and approximate nearest neighbours. Produces top-k lists in the format of the recommendation evaluator.