Experiment design
import numpy as np
import pandas as pd
from sklearn.base import BaseEstimator, TransformerMixin
from sklearn.compose import ColumnTransformer
from sklearn.model_selection import StratifiedKFold, cross_val_score
from sklearn.pipeline import make_pipeline
from sklearn.preprocessing import OneHotEncoder, OrdinalEncoder, TargetEncoder
class FrequencyEncoder(BaseEstimator, TransformerMixin):
"""Level share learned in fit (training fold only); unseen levels -> 0."""
def fit(self, X, y=None):
X = pd.DataFrame(X)
self.maps_ = {c: X[c].value_counts(normalize=True) for c in X.columns}
return self
def transform(self, X):
X = pd.DataFrame(X)
return np.column_stack([X[c].map(self.maps_[c]).fillna(0.0).to_numpy(dtype=float) for c in X.columns])
high_card = ["merchant"]
low_card = ["channel", "country"]
num_cols = ["amount", "hour"]
encoders = {
"onehot_rare": OneHotEncoder(handle_unknown="infrequent_if_exist", min_frequency=20),
"target": TargetEncoder(smooth="auto"),
"frequency": FrequencyEncoder(),
"ordinal": OrdinalEncoder(handle_unknown="use_encoded_value", unknown_value=-1),
}
cv = StratifiedKFold(5, shuffle=True, random_state=0) # or TimeSeriesSplit for temporal data
for name, enc in encoders.items():
prep = ColumnTransformer([
("hc", enc, high_card),
("lc", OneHotEncoder(handle_unknown="ignore"), low_card),
("num", "passthrough", num_cols),
])
scores = cross_val_score(make_pipeline(prep, make_model()), X, y, cv=cv, scoring="average_precision")
print(f"{name:<12} {scores.mean():.4f} ± {scores.std():.4f}")Rules:
- Same folds, same model, same hyperparameters for each variant.
- For temporal data, compare on a time-ordered holdout too: encoders that memorise levels look better on random folds than on the future.
- Measure width (number of output columns) and fit/predict time alongside the metric.
Typical outcomes
| Model | Low cardinality | High cardinality |
|---|---|---|
| Logistic regression | one-hot best | target (cross-fitted) + frequency usually beat one-hot with rare grouping |
| Random forest | ordinal ≈ one-hot | target / frequency; one-hot dilutes splits |
| LightGBM / XGBoost | native ≈ ordinal ≈ one-hot | native competitive up to a few hundred levels; target/frequency more robust beyond |
| CatBoost | cat_features | cat_features (usually the strongest without extra work) |
| k-NN / SVM | one-hot (scaled) | target encoding or embeddings; one-hot distances get dominated by mismatches |
These are tendencies, not guarantees; run the comparison.
Cost table
| Encoder | Output width | Unseen levels | Needs target | Interpretable |
|---|---|---|---|---|
| One-hot | k (or fewer with grouping) | ignore/infrequent | no | yes |
| Ordinal | 1 | unknown_value | no | partly |
| Target | 1 (classes for multiclass) | prior | yes | yes (mean outcome) |
| Frequency | 1 | 0 | no | yes |
| Hashing | N | yes | no | no |
| Native GBM | 1 | model-specific | no | partly |
Reporting
Report the chosen encoder per column with the comparison scores (mean ± std on identical folds), the holdout check for target encoding, and the serving behaviour for unseen levels.
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).
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.
counterfactual-explanation-generator
Generate counterfactual explanations and algorithmic recourse: the smallest realistic change to a row's features that changes the model's decision. Solves exact minimal-cost recourse for linear and logistic models (MAD-scaled L1 cost, immutable features, increase/decrease directions, bounds, integer and binary features, diverse alternatives, features every counterfactual must change, and a no-recourse finding when immutable features decide), generates DiCE counterfactuals for any scikit-learn model with constraints turned into permitted ranges and every result re-predicted, and validates counterfactuals from any method for constraint violations, implausible values, off-manifold rows, broken derived-feature relations and failure to flip the prediction.