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

gen_window_sql.py

Helper script for time-based-feature-builder · 120 lines

AI & Machine Learning / Classical Machine Learningv1.0.0Updated OCT 25 20264 references2 scripts
scripts/gen_window_sql.py
#!/usr/bin/env python3
"""Generate leakage-safe SQL for point-in-time window features (PostgreSQL, BigQuery, Snowflake, DuckDB).

Produces one query that joins a spine (entity, cutoff) to an event table and computes, per window,
COUNT / SUM / AVG / MAX of a value and COUNT(DISTINCT ...) of chosen columns over events with
anchor - window <= event_time < anchor, where anchor = cutoff - latency (the newest data that has
arrived), plus days from the last event to the anchor (same convention as pit_features.py). The strict "<" on the cutoff is the point: an event at the cutoff instant belongs to
the outcome side, never to the features.

With --event-level the spine is the event table itself and the current event is excluded by its id.

Usage:
    python gen_window_sql.py --dialect postgres --events payments.transactions --entity card_id \
        --time txn_ts --value amount --windows 1h 24h 7d --distinct merchant_id --event-level --id txn_id
    python gen_window_sql.py --dialect bigquery --events `proj.ds.events` --entity customer_id --time event_ts \
        --spine `proj.ds.snapshots` --cutoff score_ts --value revenue --windows 7d 30d 90d --latency 6h

Exit codes: 0 printed, 2 usage error.
"""

import argparse
import re
import sys

UNITS = {"m": ("minute", 60), "h": ("hour", 3600), "d": ("day", 86400), "w": ("week", 604800)}


def window(w):
    m = re.fullmatch(r"(\d+)([mhdw])", w)
    if not m:
        raise ValueError(f"bad window {w!r}: use 30m, 1h, 7d, 4w")
    return int(m.group(1)), UNITS[m.group(2)][0]


def minus(dialect, col, n, unit):
    if n == 0:
        return col
    if dialect == "bigquery":
        u = {"week": "DAY", "minute": "MINUTE", "hour": "HOUR", "day": "DAY"}[unit]
        k = n * 7 if unit == "week" else n
        return f"TIMESTAMP_SUB({col}, INTERVAL {k} {u})"
    if dialect == "snowflake":
        return f"DATEADD({unit}, -{n}, {col})"
    return f"{col} - INTERVAL '{n} {unit}'"            # postgres, duckdb


def days_between(dialect, a, b):
    if dialect == "bigquery":
        return f"TIMESTAMP_DIFF({b}, {a}, SECOND) / 86400.0"
    if dialect == "snowflake":
        return f"DATEDIFF(second, {a}, {b}) / 86400.0"
    return f"EXTRACT(EPOCH FROM ({b} - {a})) / 86400.0"


def main():
    ap = argparse.ArgumentParser(description="Generate point-in-time window-feature SQL.", epilog=__doc__,
                                 formatter_class=argparse.RawDescriptionHelpFormatter)
    ap.add_argument("--dialect", choices=["postgres", "duckdb", "bigquery", "snowflake"], default="postgres")
    ap.add_argument("--events", required=True)
    ap.add_argument("--entity", required=True)
    ap.add_argument("--time", required=True)
    ap.add_argument("--value")
    ap.add_argument("--distinct", nargs="*", default=[])
    ap.add_argument("--windows", nargs="+", default=["7d", "30d"])
    g = ap.add_mutually_exclusive_group(required=True)
    g.add_argument("--spine", help="snapshot table with entity + cutoff columns")
    g.add_argument("--event-level", action="store_true")
    ap.add_argument("--cutoff", default="cutoff_ts", help="cutoff column in the spine")
    ap.add_argument("--id", help="event id column (required with --event-level)")
    ap.add_argument("--latency", default="0m", help="ignore events newer than cutoff - latency (e.g. 6h)")
    a = ap.parse_args()
    try:
        wins = sorted(((w, *window(w)) for w in a.windows), key=lambda x: x[1] * UNITS[x[0][-1]][1])
        lat_n, lat_u = window(a.latency) if a.latency not in ("0", "0s", "0m") else (0, "minute")
    except ValueError as e:
        print(f"error: {e}", file=sys.stderr)
        return 2
    if a.event_level and not a.id:
        print("error: --event-level needs --id to exclude the current event", file=sys.stderr)
        return 2
    d = a.dialect
    if a.event_level:
        spine, ent, cut = f"{a.events}", f"s.{a.entity}", f"s.{a.time}"
        spine_cols = f"s.{a.id}, s.{a.entity}, s.{a.time}"
    else:
        spine, ent, cut = a.spine, f"s.{a.entity}", f"s.{a.cutoff}"
        spine_cols = f"s.{a.entity}, s.{a.cutoff}"
    upper = minus(d, cut, lat_n, lat_u)
    longest = wins[-1]
    sel = [spine_cols]
    for name, n, unit in wins:
        lower = minus(d, upper, n, unit)
        cond = f"e.{a.time} >= {lower}"
        sel.append(f"COUNT(CASE WHEN {cond} THEN 1 END) AS n_{name}")
        if a.value:
            sel.append(f"COALESCE(SUM(CASE WHEN {cond} THEN e.{a.value} END), 0) AS sum_{name}")
            sel.append(f"AVG(CASE WHEN {cond} THEN e.{a.value} END) AS mean_{name}")
            sel.append(f"MAX(CASE WHEN {cond} THEN e.{a.value} END) AS max_{name}")
        for c in a.distinct:
            sel.append(f"COUNT(DISTINCT CASE WHEN {cond} THEN e.{c} END) AS nuniq_{c}_{name}")
    sel.append(f"{days_between(d, f'MAX(e.{a.time})', upper)} AS days_since_last")
    join = [f"e.{a.entity} = {ent}", f"e.{a.time} < {upper}",
            f"e.{a.time} >= {minus(d, upper, longest[1], longest[2])}"]
    if a.event_level:
        join.append(f"e.{a.id} <> s.{a.id}")
    group = ", ".join(spine_cols.split(", "))
    sql = (f"-- Point-in-time window features ({d}); events strictly before the cutoff"
           f"{' minus ' + a.latency + ' latency' if lat_n else ''}.\n"
           f"-- days_since_last is relative to events inside the longest window ({longest[0]}); for all-time recency\n"
           f"-- or n_prior use a separate LEFT JOIN without the lower bound (it scans more data).\n"
           f"SELECT\n    " + ",\n    ".join(sel) +
           f"\nFROM {spine} s\nLEFT JOIN {a.events} e\n  ON " + "\n AND ".join(join) +
           f"\nGROUP BY {group};\n")
    print(sql, end="")
    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.