Promoting ebooks with conviction

In the previous exercise, we defined a function to compute conviction. We were asked to apply that function to all two-book permutations of the goodreads-10k dataset. In this exercise, we'll test the function by applying it to the three most popular books, which we used in earlier exercises: The Hunger Games, Harry Potter, and Twilight.

The function has been defined for you and is available as conviction. Recall that it takes an antecedent and a consequent as its two arguments. Additionally, the columns of the books DataFrame from earlier exercises are available as three separate DataFrames: potter, twilight, and hunger.

This exercise is part of the course

Market Basket Analysis in Python

Exercise instructions

Compute conviction for {Twilight} \(\rightarrow\) {Potter} and {Potter} \(\rightarrow\) {Twilight}.
Compute conviction for {Twilight} \(\rightarrow\) {Hunger} and {Hunger} \(\rightarrow\) {Twilight}.
Compute conviction for {Potter} \(\rightarrow\) {Hunger} and {Hunger} \(\rightarrow\) {Potter}.

Hands-on interactive exercise

Have a go at this exercise by completing this sample code.

# Compute conviction for twilight -> potter and potter -> twilight
convictionTP = conviction(twilight, potter)
convictionPT = conviction(____, twilight)

# Compute conviction for twilight -> hunger and hunger -> twilight
convictionTH = conviction(____, ____)
convictionHT = ____(hunger, twilight)

# Compute conviction for potter -> hunger and hunger -> potter
convictionPH = ____(potter, hunger)
convictionHP = ____

# Print results
print('Harry Potter -> Twilight: ', convictionHT)
print('Twilight -> Potter: ', convictionTP)

Edit and Run Code

This exercise is part of the course

Market Basket Analysis in Python

IntermediateSkill Level

4.9+

Start Course for Free

In this chapter, you’ll learn the basics of Market Basket Analysis: association rules, metrics, and pruning. You’ll then apply these concepts to help a small grocery store improve its promotional and product placement efforts.

Exercise 1: What is market basket analysis?Exercise 2: The basics of market basket analysis Exercise 3: Cross-selling products Exercise 4: Identifying association rules Exercise 5: Multiple antecedents and consequents Exercise 6: Preparing data for market basket analysis Exercise 7: Generating association rules Exercise 8: The simplest metric Exercise 9: One-hot encoding transaction data Exercise 10: Computing the support metric

Association rules tell us that two or more items are related. Metrics allow us to quantify the usefulness of those relationships. In this chapter, you’ll apply six metrics to evaluate association rules: supply, confidence, lift, conviction, leverage, and Zhang's metric. You’ll then use association rules and metrics to assist a library and an e-book seller.

Exercise 1: Confidence and lift Exercise 2: Recommending books with support Exercise 3: Refining support with confidence Exercise 4: Further refinement with lift Exercise 5: Leverage and conviction Exercise 6: Lift versus leverage Exercise 7: Computing conviction Exercise 8: Computing conviction with a function Exercise 9: Promoting ebooks with conviction

Current Exercise

Exercise 10: Association and dissociation Exercise 11: Computing association and dissociation Exercise 12: Defining Zhang's metric Exercise 13: Applying Zhang's metric Exercise 14: Advanced rules Exercise 15: Filtering with support and conviction Exercise 16: Using multi-metric filtering to cross-promote books

The fundamental problem of Market Basket Analysis is determining how to translate vast amounts of customer decisions into a small number of useful rules. This process typically starts with the application of the Apriori algorithm and involves the use of additional strategies, such as pruning and aggregation. In this chapter, you’ll learn how to use these methods and will ultimately apply them in exercises where you assist a retailer in selecting a physical store layout and performing product cross-promotions.

Exercise 1: Aggregation Exercise 2: Performing aggregation Exercise 3: Defining an aggregation function Exercise 4: The Apriori algorithm Exercise 5: Pruning and Apriori Exercise 6: Identifying frequent itemsets with Apriori Exercise 7: Selecting a support threshold Exercise 8: Basic Apriori results pruning Exercise 9: Generating association rules Exercise 10: Pruning with lift Exercise 11: Pruning with confidence Exercise 12: Advanced Apriori results pruning Exercise 13: Aggregation and filtering Exercise 14: Applying Zhang's rule Exercise 15: Advanced filtering with multiple metrics

In this final chapter, you’ll learn how visualizations are used to guide the pruning process and summarize final results, which will typically take the form of itemsets or rules. You’ll master the three most useful visualizations -- heatmaps, scatterplots, and parallel coordinates plots – and will apply them to assist a movie streaming service.

Exercise 1: Heatmaps Exercise 2: Visualizing itemset support Exercise 3: Heatmaps with lift Exercise 4: Interpreting heatmaps Exercise 5: Scatterplots Exercise 6: Pruning with scatterplots Exercise 7: Optimality of the support-confidence border Exercise 8: Parallel coordinates plot Exercise 9: Using parallel coordinates to visualize rules Exercise 10: Refining a parallel coordinates plot Exercise 11: Congratulations!