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

Data Volume and Sample Size

Reference for ml-feasibility-assessor · 107 lines

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

Events per variable (EPV)

For logistic regression and other parametric models, the number of minority-class events per estimated parameter controls coefficient stability and overfitting. Classic guidance is EPV >= 10; simulation studies (Riley et al. 2019, BMJ) suggest calculating the size properly, often needing 15-20+ for good calibration.

Count parameters, not columns: a categorical with 12 levels one-hot encoded is 11 parameters; a spline with 4 knots is 4-5 parameters; interactions count separately.

Minority eventsMax parameters at EPV 10Implication
505a handful of hand-picked features, strong regularisation
20020a modest model
1,000100most tabular projects
10,000+1,000+volume is not the bottleneck

Tree ensembles do not have a clean EPV rule; they need more data than linear models for the same stability, but regularisation (min_child_samples, max_depth, learning rate) and early stopping help.

Confidence interval of a proportion metric

Precision, recall, accuracy and positive rate are proportions with denominator n:

text
half_width = z * sqrt(p (1 - p) / n)          z = 1.96 for 95%
n          = z^2 p (1 - p) / half_width^2
p+/-0.05+/-0.03+/-0.02+/-0.01
0.53851,0682,4019,604
0.73238972,0178,068
0.91393858653,458

The denominator matters: recall's denominator is the positives, so at a 2% positive rate measuring recall to +/-3 points at p = 0.7 needs ~900 positives = ~45,000 test rows.

For small n or p near 0 or 1 use the Wilson interval instead of the normal approximation.

AUC standard error (Hanley and McNeil 1982)

text
Q1 = A / (2 - A)
Q2 = 2A^2 / (1 + A)
SE^2 = [A(1-A) + (n_pos - 1)(Q1 - A^2) + (n_neg - 1)(Q2 - A^2)] / (n_pos n_neg)
PositivesNegativesAUC 0.75: 95% half-widthAUC 0.85
505000.0800.068
1001,0000.0570.048
3003,0000.0330.028
1,00010,0000.0180.015

The positive count dominates. For comparing two AUCs on the same rows use DeLong's test or a paired bootstrap (see ml-model-comparison-reporter); the paired difference is much tighter than the two separate CIs suggest.

Comparing two classifiers (McNemar)

On a shared test set, only rows where the models disagree matter. With disagreement rate p_d and accuracy difference d:

text
n = (z_a sqrt(p_d) + z_b sqrt(p_d - d^2))^2 / d^2

Example: models disagree on 10% of rows; to detect a 3-point accuracy difference with 80% power at alpha 0.05 you need ~870 rows. At 5% disagreement and a 1-point difference you need ~4,000.

Learning-curve extrapolation

Fit the validation metric against training size with a power law, err(n) = a + b n^(-c), on 5-6 sizes (e.g. 10%, 20%, 40%, 60%, 80%, 100%). The asymptote a is the best achievable error with this feature set; if the current error is close to it, more data will not help, better features will. See learning-curve-diagnoser for the fitting script.

Rare events

When positives are below ~1% of rows:

  • Collect over longer windows or pool similar populations (regions, products) with a group feature.
  • Downsample negatives for training (keep all positives) and correct probabilities afterwards.
  • Evaluate on the full, natural-prevalence test set.
  • Consider anomaly detection or rules until a few hundred positives exist.

Multiclass

Plan for the rarest class you care about: 50-100 examples is a practical floor for a usable per-class F1 estimate. Merge classes below that into "other" or a hierarchy level.

Time series

  • Local models per series: at least two full seasonal cycles (two years for yearly seasonality, two weeks for weekly).
  • Global models across series: many short series can work; pool with series-level features.
  • Backtesting needs several forecast origins: history >= training window + k x horizon.

How long until we have enough?

text
periods = positives_needed / (rows_per_period x positive_rate) + label_delay

If the answer is longer than the business can wait, change the framing (longer window, broader event definition), start with rules and collect labels from them, or buy/borrow data.

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.