01

Foundation

Introduction to Segmentation

Before diving into RFM, it helps to understand the broader landscape of how businesses group their audiences.

Market Segmentation

Dividing a broad target market into segments based on demographics, geography, psychographics, or behaviour. The goal: develop customised strategies for each group to maximise marketing effectiveness and resource allocation.

Customer Segmentation

Goes deeper than market segmentation by incorporating past interactions, purchase history, lifetime value, visit frequency, and spending patterns. Uncovers the shared characteristics of your most profitable customer groups.

Key distinction: Market segmentation identifies your target audience; customer segmentation uncovers types within your existing customer base.

Segmentation Variables

TypeExample Variables
DemographicGender, age, marital status, occupation, income
GeographicCity, region, country
PsychographicInterests, values, character & personality traits
BehaviouralPurchases, product preference, frequency, amount spent
TechnographicDevice type, browser, software, websites
Needs-basedFinancial (discounts), emotional (service feedback), physical

Why segment?

  • Targeted campaigns — Personalised messaging to each segment’s interests
  • Better communication — Right channel for the right customer
  • Product improvements — Direct view into customer challenges
  • Stronger relationships — Every customer feels valued, not generic
  • Revenue growth — Informed upselling and cross-selling
  • Cost efficiency — Focus spend on responsive segments

02

Core Concept

What is RFM?

A quantitative method that scores every customer on three behavioural dimensions.

R

Recency

How recently did the customer purchase? Recent buyers still have the product on their mind and are more likely to buy again.

F

Frequency

How often do they buy? Frequent purchasers have established a habit and are more likely to return.

M

Monetary

How much do they spend? High spenders deliver the most revenue and tend to continue spending.

Origin: Introduced in 1995 by Bult & Wansbeek in Marketing Science for catalogue retailers. It confirmed the Pareto Principle — 80% of sales come from 20% of customers.

What can you do with RFM?

  • Identify high-value customers — Score 555 = VIP. Foster deeper relationships
  • Customise marketing — Different strategies per segment
  • Improve retention — Score 1XX = at risk. Trigger win-back campaigns
  • Reduce costs — Stop sending campaigns to unresponsive customers
03

Methodology

The 4-Step RFM Workflow

From raw transactions to actionable customer segments.

1

Data Collection

Gather transaction-level data with three essentials: Customer ID, Order Date, and Revenue Amount. If pre-aggregated, include last transaction date and total spend per customer.

2

Build the RFM Table

Aggregate by Customer ID: count orders (Frequency), find most recent order date, and sum revenue (Monetary). Calculate elapsed days since last order relative to your analysis date for Recency.

3

Assign RFM Scores

Sort each dimension and divide into quintiles (5 equal-sized groups). Assign scores 1–5, where 5 = best. For Recency: lowest elapsed days = 5. For Frequency and Monetary: highest values = 5.

4

Create Segments

Combine R, F, M scores into a three-digit code (e.g., 555 = best customer, 111 = least engaged). Group codes into meaningful segments with descriptive labels.

04

Strategy

Segmentation Strategies

125 possible RFM cells (5×5×5) are too many to act on. Here’s how to reduce them.

25-Segment Matrix

Use only R and F scores as axes, with M as an aggregation metric (mean monetary per cell). Reduces 125 cells to a manageable 5×5 grid. Each cell answers: “How recent and how frequent, with what average spend?”

11-Segment Strategy

A popular industry approach that maps RFM scores into named personas. Each gets a tailored engagement strategy.

The 11 RFM Segments & Engagement Strategies

SegmentRFMAction
Champions54–54–5Reward them; early access to new launches
Loyal Customers3–44–54–5Suggest higher-value products; ask for reviews
Potential Loyalists4–52–32–3Loyalty programmes; cross-category recommendations
New Customers4–51–21–2Smooth onboarding; post-sale support
Promising3–41–21–2Brand awareness; free trials
Need Attention32–32–3Limited-period offers; personalised recommendations
About to Sleep2–31–31–3Reactivation offers; popular products
At Risk1–23–43–4Best deals; highest-rated product recommendations
Can’t Lose Them<24–54–5Listen to feedback; win them back with new products
Hibernating1–21–21–2Cross-category offers; personalised outreach
Lost111Periodic brand awareness campaigns
Key questions the matrix answers: Who are your best customers? Who’s about to churn? Who can be converted into more profitable customers? Who must you retain at all costs?
05

Advanced

Beyond Basic RFM

Hurdle rates, RFM variations, and combining RFM with clustering.

Hurdle Rate Analysis

Set thresholds for each R, F, M dimension (e.g., purchased within 90 days, 3+ purchases, $500+ spent) and track the percentage of customers clearing each hurdle over time.

  • Rates rising? — Business is healthy; customers respond positively
  • Rates falling? — High-value customers are defecting; future value is declining
  • One hurdle drops? — Pinpoints exactly which behaviour needs attention

RFM Across Industries

  • E-commerce — Personalised product recommendations based on purchase recency, frequency, and spend
  • Travel & Hospitality — Loyalty programme enhancement by segmenting booking behaviour
  • Gaming — In-game purchase optimisation using login frequency and monetisation patterns
  • Media & Content — Subscription renewal and engagement strategy based on consumption behaviour

RFD — Duration

Replaces Monetary with Duration for viewership/readership businesses (e.g., Netflix). Measures session length instead of spending.

RFE — Engagement

Replaces Monetary with Engagement — pages per visit, interactions, or similar metrics. Ideal for platforms like TikTok or content sites.


06

Evaluation

Strengths & Limitations

Strengths

  • Simple to understand and implement
  • Provides directly actionable segments
  • Customisable thresholds per industry
  • Identifies high-value customers immediately
  • Flexible segmentation granularity

Limitations

  • Ignores demographics and preferences
  • Static snapshot — doesn’t track changes over time
  • Focuses only on monetary transactions
  • Assumes R, F, M are independent (often not true)
  • Threshold selection is subjective
01

Foundation

Introduction to Clustering

An unsupervised learning method that discovers natural patterns in data and groups them into meaningful clusters.

What is Clustering?

Clustering reduces complex datasets into smaller, homogeneous groups. Observations within a cluster are similar to each other but dissimilar to observations in other clusters. No predefined categories — the algorithm discovers the structure.

Clustering vs Classification

Classification assigns data to known categories (supervised). Clustering discovers unknown categories (unsupervised). Classification needs labelled training data; clustering works with unlabelled data.

The clustering goal: Minimise intra-cluster distance (members are similar) while maximising inter-cluster distance (groups are distinct).

The Cluster Analysis Process

  • Select variables — Choose relevant features; reduce dimensions if too many correlated variables
  • Define distance metric — Choose how to measure similarity between data points
  • Apply clustering technique — Split observations into clearly different groups
  • Determine number of clusters — Use technical and business criteria to find optimal K
  • Profile each cluster — Create descriptions based on variable values within each cluster
  • Validate — Confirm clusters are meaningful and actionable; iterate if needed
02

Mathematics

Similarity & Distance Measures

Clustering algorithms need a way to quantify how “close” or “far” data points are.

Euclidean Distance

The default distance measure for K-Means. Calculates the straight-line distance between two points in multi-dimensional space. Example: Australia–Italy distance = 5.39 (similar), Australia–Somalia = 144.40 (very different).

Standardise First

Variables on different scales (e.g., income in thousands vs. age in decades) will distort distance calculations. Always standardise your data before clustering so each variable contributes equally.

Non-Numerical Data

Ordinal data (e.g., Likert scale: Strongly Disagree → Strongly Agree) can use index-based distances. Nominal data (e.g., gender, marital status) generally should not be used for clustering — use them later for profiling instead.

Other Distance Measures

  • Manhattan (City-block) — Sum of absolute differences; less sensitive to outliers than Euclidean
  • Chebychev — Maximum difference across any single dimension
  • Mahalanobis — Accounts for correlations between variables and differences in scale
03

Method 1

Hierarchical Clustering

Builds a tree of clusters by progressively merging (or splitting) groups.

Agglomerative (Bottom-Up)

Start with each point as its own cluster. At each step, merge the closest pair. Repeat until a single cluster remains. The most common variant. Results displayed as a dendrogram.

Divisive (Top-Down)

Start with one all-inclusive cluster. Recursively split using a flat algorithm (e.g., K-Means with k=2) until only singletons remain.

Inter-Cluster Distance Methods

  • Single Linkage — Distance between the closest points of two clusters
  • Complete Linkage — Distance between the farthest points
  • Average Linkage — Average distance of all point pairs
  • Ward’s Method — Minimises total within-cluster variance on merge
  • Centroid — Distance between cluster centres
Limitations: Merges cannot be undone; computationally heavy for large datasets; hard to decide where to “cut” the dendrogram; a single pass may yield suboptimal results.

04

Method 2

K-Means Clustering

The most widely used clustering algorithm — simple, fast, and surprisingly effective.

1

Choose K & Initialise

Specify the number of clusters K. Randomly select K data points as initial centroids (seed points).

2

Assign Points

Calculate the distance from every data point to each centroid. Assign each point to its nearest centroid, forming K clusters.

3

Recompute Centroids

For each cluster, calculate the new centroid (mean position of all assigned points).

4

Repeat Until Stable

Iterate steps 2–3 until no points change clusters, centroids stabilise, or a maximum iteration count is reached.

Initial centroids matter. Different starting points can produce different results. Use K-Means++ (Arthur & Vassilvitskii, 2007) to spread initial centroids far apart, or run multiple initialisations (nstart = 25) and pick the best.

K-Means Variations

  • K-Medoids — Uses actual data points (medoids) as cluster centres instead of means; more robust to outliers
  • K-Median — Computes median in each dimension using Manhattan distance
  • K-Modes — For categorical data; clusters based on matching categories
  • K-Prototype — Combines K-Modes and K-Means for mixed numerical/categorical data
05

Validation

Evaluating Cluster Quality

How do you know your clusters are good? Two complementary approaches: technical metrics and business profiling.

Technical Validation

Elbow Method (WSS)

Run K-Means for k=2…10 and plot Within-cluster Sum of Squares. Look for the “elbow” where adding more clusters gives diminishing returns.

Silhouette Coefficient

Measures both cohesion (intra-cluster) and separation (inter-cluster). Ranges from −1 (worst) to +1 (best). Score > 0.3 is generally acceptable.

  • Cluster sizes — One dominant cluster may need further splitting; very small clusters may be outliers
  • Boxplots — Show variable distributions per cluster; look for significant differences across variables

Business Validation — Cluster Profiling

Technical metrics alone aren’t enough. Work with domain experts to answer four questions:

  • Distinguishing characteristics? — Look for extreme highs and lows in each cluster
  • Explainable? — Can each cluster be described in business terms?
  • Labelable? — Can you intuitively assign names? (e.g., “Advanced”, “Moderate”, “Developing”)
  • Actionable? — Can each cluster drive a specific marketing, sales, or service action?

06

Evaluation

Strengths & Limitations

Strengths

  • Enables personalised marketing per segment
  • Data-driven — removes subjective bias
  • Improves customer satisfaction
  • Optimises resource allocation
  • Generates deep behavioural insights

Limitations

  • Assumes homogeneity within clusters
  • Choosing optimal K is non-trivial
  • Interpretation can be subjective
  • Real customers may span multiple segments
  • Sensitive to outliers and noise

Applications Across Industries

  • Sales & Marketing — Discover customer groups and develop targeted campaigns
  • Fraud Detection — Identify uncharacteristic transaction behaviour
  • Healthcare — Group patients by risk profile for predictive care
  • Insurance — Identify policyholder groups with high claim costs

Interested in this module?

Part of the Customer Analytics programme. Get in touch for details.

Get In Touch