Variance-stabilising transforms
| Transform | Formula | Domain | Use |
|---|---|---|---|
| log | log(x) | x > 0 | multiplicative effects, right skew |
| log1p | log(1 + x) | x >= 0 | counts and amounts with zeros |
| sqrt | √x | x >= 0 | counts (Poisson-like), milder than log |
| Box-Cox | (x^λ − 1)/λ, log x at λ = 0 | x > 0 | fitted λ per column |
| Yeo-Johnson | Box-Cox-like with a branch for negatives | all reals | skew with negative values |
| asinh | log(x + √(x² + 1)) | all reals | log-like for signed amounts (profit/loss) |
| logit | log(p / (1 − p)) | 0 < p < 1 | proportions |
| rank / quantile | empirical CDF | any | heavy tails, monotone relations only |
Rule of thumb: if the domain relationship is multiplicative ("10% more spend") use log; if you just need to tame a tail for a linear model, Yeo-Johnson or quantile.
Detecting outliers before choosing a scaler
| Method | Rule | Notes |
|---|---|---|
| Robust z-score | x − median | |
| IQR fences | x < Q1 − 1.5·IQR or x > Q3 + 1.5·IQR | flags many points in skewed data |
| Domain limits | age > 120, negative prices | data errors: fix, don't scale |
| Sentinels | 999999, −1 meaning "unknown" | replace with NaN + missing indicator |
Distinguish errors (fix or drop), sentinels (convert to missing) and genuine extremes (keep, then choose a robust scaler or transform).
Winsorising (clipping)
lo, hi = X_train["amount"].quantile([0.01, 0.99])
X_train["amount"] = X_train["amount"].clip(lo, hi)
X_test["amount"] = X_test["amount"].clip(lo, hi) # same bounds, learned on trainImplement as a transformer so bounds are learned per fold:
from sklearn.base import BaseEstimator, TransformerMixin
import numpy as np
class QuantileClipper(BaseEstimator, TransformerMixin):
def __init__(self, lower=0.01, upper=0.99):
self.lower, self.upper = lower, upper
def fit(self, X, y=None):
X = np.asarray(X, dtype=float)
self.lo_ = np.nanquantile(X, self.lower, axis=0)
self.hi_ = np.nanquantile(X, self.upper, axis=0)
return self
def transform(self, X):
return np.clip(np.asarray(X, dtype=float), self.lo_, self.hi_)Binning
KBinsDiscretizer(n_bins=10, strategy="quantile", encode="onehot") turns a skewed column into robust
indicators. Useful for linear scorecards (credit) and when the effect is step-like; costs information.
Target transforms for regression
from sklearn.compose import TransformedTargetRegressor
from sklearn.linear_model import Ridge
import numpy as np
model = TransformedTargetRegressor(regressor=make_pipeline(prep, Ridge()), func=np.log1p, inverse_func=np.expm1)- Predictions are back-transformed automatically.
- Retransformation bias: exp(E[log y]) <= E[y]. For totals multiply predictions by the smearing factor
mean(exp(residuals_on_log_scale))(Duan 1983), or fit a Gamma/Tweedie GLM/GBM on the raw target instead. - Metrics must be computed on the original scale for business reporting.
Choosing between options empirically
Compare two or three transforms on the same CV folds with the final model; pick the simplest that is not worse. For tree models do not bother: they are invariant to monotone transforms of features (but not of the target).
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.