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

temporal_split.py

Helper script for recommendation-system-designer · 117 lines

AI & Machine Learning / Classical Machine Learningv1.0.0Updated OCT 25 20263 references3 scripts
scripts/temporal_split.py
#!/usr/bin/env python3
"""Split an interaction log into train and test the way a recommender is used: by time.

Modes:
  leave-last   the last --n interactions of every user (by timestamp) go to test; users need at least
               --min-train interactions left in train, otherwise all their rows stay in train
  global       every interaction at or after a cut-off (--cutoff timestamp, or the --test-frac quantile of
               time) goes to test; this matches deployment (train on the past, recommend the future) and is
               the stricter protocol
With --min-rating, test rows below the threshold are dropped (only positive interactions are relevance
targets); train keeps everything.

Writes <prefix>_train.csv and <prefix>_test.csv and reports sizes, users in test that are cold in train
(should be evaluated separately) and test items never seen in train (unrecommendable by pure CF).

Usage:
    python temporal_split.py ratings.csv --mode leave-last --n 2 --prefix ratings
    python temporal_split.py events.csv --mode global --test-frac 0.2 --time-col ts --prefix events
    python temporal_split.py ratings.csv --mode leave-last --n 1 --min-rating 4 --prefix pos

Exit codes: 0 written, 2 usage or read error.
"""

import argparse
import csv
import datetime as dt
import math
import sys
from collections import defaultdict


def to_time(v):
    try:
        x = float(v)
        if math.isfinite(x):
            return x
    except (TypeError, ValueError):
        pass
    try:
        return dt.datetime.fromisoformat(str(v).replace("Z", "+00:00")).timestamp()
    except ValueError:
        raise ValueError(f"cannot parse timestamp {v!r}")


def main():
    ap = argparse.ArgumentParser(description="Temporal train/test split for recommenders.", epilog=__doc__,
                                 formatter_class=argparse.RawDescriptionHelpFormatter)
    ap.add_argument("csv")
    ap.add_argument("--mode", choices=["leave-last", "global"], default="leave-last")
    ap.add_argument("--n", type=int, default=1, help="test interactions per user (leave-last)")
    ap.add_argument("--min-train", type=int, default=2)
    ap.add_argument("--cutoff", help="timestamp for --mode global")
    ap.add_argument("--test-frac", type=float, default=0.2)
    ap.add_argument("--user-col", default="user_id")
    ap.add_argument("--item-col", default="item_id")
    ap.add_argument("--time-col", default="timestamp")
    ap.add_argument("--rating-col", default="rating")
    ap.add_argument("--min-rating", type=float)
    ap.add_argument("--prefix", default="split")
    a = ap.parse_args()
    try:
        with open(a.csv, newline="", encoding="utf-8") as f:
            reader = csv.DictReader(f)
            header = reader.fieldnames or []
            rows = list(reader)
        for c in (a.user_col, a.item_col, a.time_col):
            if c not in header:
                raise ValueError(f"column {c!r} not found (have: {', '.join(header)})")
        if a.min_rating is not None and a.rating_col not in header:
            raise ValueError(f"--min-rating needs the rating column {a.rating_col!r}")
        for r in rows:
            r["__t"] = to_time(r[a.time_col])
    except (OSError, ValueError) as e:
        print(f"error: {e}", file=sys.stderr)
        return 2
    train, test = [], []
    if a.mode == "leave-last":
        by_user = defaultdict(list)
        for r in rows:
            by_user[r[a.user_col]].append(r)
        for u, rs in by_user.items():
            rs.sort(key=lambda r: r["__t"])
            if len(rs) - a.n >= a.min_train:
                train += rs[:-a.n]
                test += rs[-a.n:]
            else:
                train += rs
    else:
        ts = sorted(r["__t"] for r in rows)
        cut = to_time(a.cutoff) if a.cutoff else ts[int(len(ts) * (1 - a.test_frac))]
        for r in rows:
            (test if r["__t"] >= cut else train).append(r)
    if a.min_rating is not None:
        test = [r for r in test if float(r[a.rating_col] or 0) >= a.min_rating]
    train_users = defaultdict(int)
    for r in train:
        train_users[r[a.user_col]] += 1
    train_items = {r[a.item_col] for r in train}
    test_users = {r[a.user_col] for r in test}
    cold_test_users = [u for u in test_users if train_users.get(u, 0) < 5]
    unseen_items = {r[a.item_col] for r in test} - train_items
    for name, part in (("train", train), ("test", test)):
        with open(f"{a.prefix}_{name}.csv", "w", newline="", encoding="utf-8") as f:
            w = csv.DictWriter(f, fieldnames=header)
            w.writeheader()
            for r in part:
                w.writerow({k: r[k] for k in header})
    print(f"{a.mode}: train {len(train)} rows, test {len(test)} rows ({len(test_users)} users) -> "
          f"{a.prefix}_train.csv, {a.prefix}_test.csv")
    print(f"test users with < 5 train interactions: {len(cold_test_users)}   test items unseen in train: "
          f"{len(unseen_items)}" + (" (pure CF cannot recommend these)" if unseen_items else ""))
    return 0


if __name__ == "__main__":
    sys.exit(main())
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.