CLVTools
0.12.1Tools for Customer Lifetime Value Estimation
Overview
A set of state-of-the-art probabilistic modeling approaches to derive estimates of individual customer lifetime values (CLV). Commonly, probabilistic approaches focus on modelling 3 processes, i.e. individuals' attrition, transaction, and spending process. Latent customer attrition models, which are also known as "buy-'til-you-die models", model the attrition as well as the transaction process. They are used to make inferences and predictions about transactional patterns of individual customers such as their future purchase behavior. Moreover, these models have also been used to predict individuals’ long-term engagement in activities such as playing an online game or posting to a social media platform. The spending process is usually modelled by a separate probabilistic model. Combining these results yields in lifetime values estimates for individual customers. This package includes fast and accurate implementations of various probabilistic models for non-contractual settings (e.g., grocery purchases or hotel visits). All implementations support time-invariant covariates, which can be used to control for e.g., socio-demographics. If such an extension has been proposed in literature, we further provide the possibility to control for time-varying covariates to control for e.g., seasonal patterns. Currently, the package includes the following latent attrition models to model individuals' attrition and transaction process: [1] Pareto/NBD model (Pareto/Negative-Binomial-Distribution), [2] the Extended Pareto/NBD model (Pareto/Negative-Binomial-Distribution with time-varying covariates), [3] the BG/NBD model (Beta-Gamma/Negative-Binomial-Distribution) and the [4] GGom/NBD (Gamma-Gompertz/Negative-Binomial-Distribution). Further, we provide an implementation of the Gamma/Gamma model to model the spending process of individuals.
Install
Health
- OK2026-08-0513 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- NOTE2026-08-0112 OK · 1 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- OK2026-04-2512 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- ERROR2026-03-3011 OK · 2 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE
- NOTE2026-03-1011 OK · 3 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
Documentation
- Examples that run
- 17%
- Documented parameters
- 100%
- Return-value docs
- 75%
- References docs
- 26%
Downloads
Repository
Stars over time
Forks over time
Releases over time
Issues over time
PRs over time
Repository practices
3 development-tooling and community-health practices detected across 3 families in the upstream repository
Checks run against github.com/bachmannpatrick/clvtools on 2026-08-09.
Dependencies
Nothing depends on this yet.
Code & Tests
People & History
12 releases. Pick two to compare their code metrics. R releases are shown for context.
- RR 4.6.0 released · 2026-04-24
- 0.12.1Latest
- 0.12.02025-09-22 · diff ↗
- RR 4.5.0 released · 2025-04-11
- 0.11.22024-12-02 · diff ↗
- 0.11.12024-10-13 · diff ↗
- 0.11.02024-08-17 · diff ↗
- RR 4.4.0 released · 2024-04-24
- 0.10.02023-10-23 · diff ↗
- RR 4.3.0 released · 2023-04-21
- RR 4.2.0 released · 2022-04-22
- 0.9.02022-01-09 · diff ↗
- 0.8.12021-10-19 · diff ↗
- RR 4.1.0 released · 2021-05-18
- 0.8.02021-03-23 · diff ↗
- 0.7.02020-08-26 · diff ↗
Show 3 earlier events
- 0.6.02020-06-25 · diff ↗
- 0.5.02020-05-08
- RR 4.0.0 released · 2020-04-24
Package metadata
- First published
- 2020-05-08
- Total releases
- 12 / 6 yrs
- License
- GPL-3 OSI
- Minimum R
- ≥ 3.5.0
- Bundled data
- 104 KB / 5 files
- Download size
- 2.1 MB
- Installed size
- not tracked yet
- With dependencies
- not tracked yet
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("CLVTools")This is what citation() produces when a package has no citation file of its own. If it prints something else, use that.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-08-11, which the citation names so these numbers can be found later. More on citing and the projects behind them.