The Internet has freed us from the shackles of the yellow page directory, the trip to the nearby store to learn what is available, and the forced choice among a limited set of alternatives. The consumer is in control of their purchase journey and can take any path they wish. But do they? It’s a lot of work for our machetewielding consumer cutting their way through the product jungle. The consumer decision journey is not an itinerary, but neither is it aimless meandering. Perhaps we do not wish to follow the wellworn trail laid out by some marketing department. The consumer is free to improvise, not by going where no one has gone before, but by creating personal variation using a common set of journey components shared with others.
Even with all the different ways to learn about products and services, we find constraints on the purchase process with some touchpoint combinations more likely than others. For example, one could generate a long list of all the possible touchpoints that might trigger interest, provide information, make recommendations, and enable purchase. Yet, we would expect any individual consumer to encounter only a small proportion of this long list. A common journey might be no more than a seeing an ad followed by a trip to a store. For frequently purchased products, the entire discoverylearningcomparingpurchase process could collapse into a single pointofsale (PoS) touchpoint, such as product packaging on a retail shelf.
The figure below comes from a touchpoint management article discussing the new challenges of online marketing. This example was selected because it illustrates how easy it is to generate touchpoints as we think of all the ways that a consumer interacts with or learns about a product. Moreover, we could have been much more detailed because episodic memory allows us to relive the product experience (e.g., the specific ads seen, the packaging information attended to, the pages of the website visited). The touchpoint list quickly gets lengthy, and the data matrix becomes sparser because an individual consumer is not likely to engage intensively with many products. The resulting checklist dataset is a highdimensional consumerbytouchpoint matrix with lots of columns and cells containing some ones but mostly zeroes.
It seems natural to subdivide the columns into separate modes of interaction as shown by the coloring in the above figure (e.g., POS, OnetoOne, Indirect, and Mass). It seems natural because different consumers rely on different modes to learn and interact with product categories. Do you buy by going to the store and selecting the best available product, or do you search and order online without any physical contact with people or product? Like a Rubik’s cube, we might be able to sort rows and columns simultaneously so that the reordered matrix would appear to be block diagonal with most of the ones within the blocks and most of the zeroes outside. You can find an illustration in a previous post on the reorderable data matrix. As we shall see later, nonnegative matrix factorization “reorders” indirectly by excluding negative entries in the data matrix and its factors. A more direct approach to reordering would use the R packages for biclustering or seriation. Both of these links offer different perspectives on how to cluster or order rows and columns simultaneously.
Nonnegative Matrix Factorization (NMF) with Simulated Data
I intend to rely on the R package NMF and a simulated data set based on the above figure. I will keep it simple and assume only two pathways: an online journey through the 10 touchpoints marked with an “@” in the above figure and an offline journey through the remaining 20 touchpoints. Clearly, consumers are more likely to encounter some touchpoints more often than others, so I have made some reasonable but arbitrary choices. The R code at the end of this post reveals the choices that were made and how I generated the data using the sim.rasch function from the psych R package. Actually, all you need to know is that the dataset contains 400 consumers, 200 interacting more frequently online and 200 with greater offline contact. I have sorted the 30 touchpoints from the above figure so that the first 10 are online (e.g., search engine, website, user forum) and the last 20 are offline (e.g., packaging information, ad in magazine, information display). Although the patterns within each set of online and offline touchpoints are similar, the result is two clearly different pathways as shown by the following plot.
It should be noted that the 400 x 30 data matrix contained mostly zeroes with only 11.2% of the 12,000 cells indicating any contact. Seven of the respondents did not indicate any interaction at all and were removed from the analysis. The mode was 3 touchpoints per consumer, and no one reported more than 11 interactions (although the verb “reported” might not be appropriate to describe simulated data).
If all I had was the 400 respondents, how would I identify the two pathways? Actually, kmeans often does quite well, but not in this case with so many infrequent binary variables. Although using the earlier mentioned biclustering approach in R, Dolnicar and her colleagues will help us understand the problems encounters when conducting market segmentation with highdimensional data. When asked to separate the 400 into two groups, kmeans clustering was able to identify correctly only 55.5% of the respondents. Before we overgeneralize, let me note that kmeans performed much better when the proportions were higher (e.g., raise both lines so that they peak above 0.5 instead of below 0.4), although that is not much help with highdimensional scare data.
And, what about NMF? I will start with the results so that you will be motivated to remain for the explanation in the next section. Overall, NMF placed correctly 81.4% of the respondents, 85.9% of the offline segment and 76.9% of the online segment. In addition, NMF extracted two latent variables that separated the 30 touchpoints into the two sets of 10 online and 20 offline interactions.
So, what is nonnegative matrix factorization?
Have you run or interpreted a factor analysis? Factor analysis is matrix factorization where the correlation matrix R is factored into factor loadings: R = FF’. Structural equation modeling is another example of matrix factorization, where we add direct and indirect paths between the latent variables to the factor model connecting observed and latent variables. However, unlike the two previous models that factor the correlation or variancecovariance matrix among the observed variables, NMF attempts to decompose the actual data matrix.
Wikipedia uses the following diagram to show this decomposition or factorization:
The matrix V is our data matrix with 400 respondents by 30 touchpoints. A factorization simplifies V by reducing the number of columns from the 30 observed touchpoints to some smaller number of latent or hidden variables (e.g., two in our case since we have two pathways). We need to rotate the H matrix by 90 degrees so that it is easier to read, that is, 2×30 to 30×2. We do this by taking the transpose, which in R code is t(H).
Online

Offline


Search engine

83

2

Price comparison

82

0

Website

96

0

Hint from Expert

40

0

User forum

49

0

Banner or Popup

29

11

Newsletter

13

3

Email request

10

3

Guidebook

8

2

Checklist

7

5

Packaging information

4

112

PoS promotion

1

109

Recommendation friends

6

131

Show window

0

61

Information at counter

11

36

Advertising entrance

3

54

Editorial newspaper

4

45

Consumer magazine

5

54

Ad in magazine

1

40

Flyer

0

41

Personal advice

0

22

Sampling

5

10

Information screen

1

12

Information display

5

19

Customer magazine

4

22

Poster

0

9

Voucher

0

12

Catalog loyalty program

2

9

Offer loyalty card

2

9

Service hotline

2

4

As shown above, I have labeled the columns to reflect their largest coefficients in the same way that one would name a factor in terms of its largest loadings. To continue with the analogy to factor analysis, the touchpoints in V are observed, but the columns of W and the rows of H are latent and named using their relationship to the touchpoints. Can we call these latent variables “parts,” as Seung and Lee did in their 1999 article “Learning the Parts of Objects by NMF“? The answer depends on how much overlap between the columns you are willing to accept. When each row of H contains only one large positive value and the remaining columns for that row are zero (e.g., Website in the third row), we can speak of latent parts in the sense that adding columns does not change the impact of previous columns but simply adds something new to the V approximation.
So in what sense is online or offline behavior a component or a part? There are 30 touchpoints. Why are there not 30 components? In this context, a component is a collection of touchpoints that vary together as a unit. We simulated the data using two different likelihood profiles. The argument called d in the sim.rasch function (see the R code at the end of this post) contains 30 values controlling the likelihood that the 30 touchpoints will be assigned a one. Smaller values of d result in higher probabilities that the touchpoint interaction will occur. The coefficients in each latent variable of H reflect those d values and constitute a component because the touchpoints vary together for 200 individuals. Put another way, the whole with 400 respondents contains two parts of 200 respondents each and each with its own response generation process.
The one remaining matrix, W, must be of size 400×2 (# respondents times # latent variables). So, we have 800 entries in W and 60 cells in H compared to the 12,000 observed values in V. W has one row for each respondent. Here are the rows of W for the 200th and 201st respondents, which is the dividing line between the two segments:
The numbers are small because we are factoring a data matrix of zeroes and ones. But the ratios of these two numbers are sizeable. The 200th respondent has an offline latent score (0.00546) more than 36 times its online latent score (0.00015), and the ratio for the 201st respondent is more than 32 in the other direction with online dominating. Finally, in order to visualize the entire W matrix for all respondents, the NMF package will produce heatmaps like the following with the R code basismap(fit, Rowv=NA).
As before, the first column represent online and the second points to offline. The first 200 rows are offline respondents or our original Segment 1 (labeled basis 2), and the last 200 or our original Segment 2 were generated using the online response pattern (labeled basis 1). This type of relabeling or renumbering occurs over and over again in cluster analysis, so we must learn to live with it. To avoid confusion, I will repeat myself and be explicit.
As mentioned earlier, Segment 1 offline respondents had a higher classification accuracy (85.9% vs. 76.9%). This is shown by the more solid and darker red lines for the first 200 offline respondents in the second basis 2 column.
Consumer Improvisation Might Be Somewhat More Complicated
Introducing only two segments with predominantly online or offline product interactions was a simplification necessary to guide the reader through an illustrative example. Obviously, the consumer has many more components that they can piece together on their journey. However, the building blocks are not individual touchpoints but set of touchpoints that are linked together and operate as a unit. For example, visiting a brand website creates opportunities for many different microjourneys over many possible links on each page. Recurring website microjourneys experienced by several consumers would be identified as a latent components in our NMF analysis. At least, this what I have found using NMF with touchpoint checklists from marketing research questionnaires.
R Code to Reproduce All the Analysis in this Post
library(psych)
set.seed(6112014)
offline<sim.rasch(nvar=30, n=200, mu=0.5, sd=0,
d=c(2,2,2,3,3,3,4,4,4,4,0,0,0,1,1,1,1,1,1,1,2,2,2,2,2,2,3,3,3,3))
online<sim.rasch(nvar=30, n=200, mu=0.5, sd=0,
d=c(0,0,0,1,1,1,2,2,2,2,1,1,1,2,2,2,2,2,2,2,3,3,3,3,3,3,4,4,4,4))
tp<rbind(offline$items,
online$items)
tp<data.frame(tp)
names(tp)<c("Search engine",
"Price comparison",
"Website",
"Hint from Expert",
"User forum",
"Banner or Popup",
"Newsletter",
"Email request",
"Guidebook",
"Checklist",
"Packaging information",
"PoS promotion",
"Recommendation friends",
"Show window",
"Information at counter",
"Advertising entrance",
"Editorial newspaper",
"Consumer magazine",
"Ad in magazine",
"Flyer",
"Personal advice",
"Sampling",
"Information screen",
"Information display",
"Customer magazine",
"Poster",
"Vocher",
"Catalog loyalty program",
"Offer loyalty card",
"Service hotline")
rows<apply(tp,1,sum)
table(rows)
cols<apply(tp,2,sum)
cols
fill<sum(tp)/(400*30)
fill
segment<c(rep(1,200),rep(2,200))
segment
seg_profile<t(aggregate(tp, by=list(segment), FUN=mean))
plot(c(1,30),c(min(seg_profile[2:30,]),
max(seg_profile[2:30,])), type="n",
xlab="Touchpoints (First 10 Online/Last 20 Offline)",
ylab="Proportion Experiencing Touchpoint")
lines(seg_profile[2:30,1], col="blue", lwd=2.5)
lines(seg_profile[2:30,2], col="red", lwd=2.5)
legend('topright',
c("Offline","Online"), lty=c(1,1),
lwd=c(2.5,2.5), col=c("blue","red"))
tp_cluster<kmeans(tp[rows>0,], 2, nstart=25)
tp_cluster$center
table(segment[rows>0],tp_cluster$cluster)
library(NMF)
fit<nmf(tp[rows>0,], 2, "frobenius")
fit
summary(fit)
W<basis(fit)
round(W*10000,0)
W2<max.col(W)
table(segment[rows>0],W2)
H<coef(fit)
round(t(H),2)
basismap(fit,Rowv=NA)
Created by Pretty R at insideR.org
Rbloggers.com offers daily email updates about R news and tutorials on topics such as: Data science, Big Data, R jobs, visualization (ggplot2, Boxplots, maps, animation), programming (RStudio, Sweave, LaTeX, SQL, Eclipse, git, hadoop, Web Scraping) statistics (regression, PCA, time series, trading) and more...