Computing conviction with a function

After successful completion of her trial project, the ebook start-up's founder decides to hire you for a much bigger project. She asks you if you are able to compute conviction for every pair of books in the goodreads-10k dataset, so she can use that information to decide which books to locate closer together on the website.

You agree to take the job, but realize that you need more a efficient way to compute conviction, since you will need to compute it many times. You decide to write a function that computes it. It will take two columns of a pandas DataFrame as an input, one antecedent and one consequent, and output the conviction metric. Note that pandas is available as pd and numpy is available as np.

Diese Übung ist Teil des Kurses

Market Basket Analysis in Python

Anleitung zur Übung

Compute the support for the antecedent and assign it to supportA.
Compute the support for NOT consequent.
Compute the support for antecedent and NOT consequent.

Interaktive Übung

Versuche dich an dieser Übung, indem du diesen Beispielcode vervollständigst.

def conviction(antecedent, consequent):
	# Compute support for antecedent AND consequent
	supportAC = np.logical_and(antecedent, consequent).mean()

	# Compute support for antecedent
	supportA = ____.____()

	# Compute support for NOT consequent
	supportnC = 1.0 - ____.____()

	# Compute support for antecedent and NOT consequent
	supportAnC = ____ - supportAC

    # Return conviction
	return supportA * supportnC / supportAnC

Code bearbeiten und ausführen

Diese Übung ist Teil des Kurses

Market Basket Analysis in Python

Mittlere SchwierigkeitSchwierigkeitsgrad

4.9+

Kurs kostenlos starten

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

Aktuelle Übung

Exercise 9: Promoting ebooks with conviction 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!