Identifying frequent itemsets with Apriori

The aggregation exercise you performed for the online retailer proved helpful. It offered a starting point for understanding which categories of items appear frequently in transactions. The retailer now wants to explore the individual items themselves to find out which are frequent.

In this exercise, you'll apply the Apriori algorithm to the online retail dataset without aggregating first. Your objective will be to prune the itemsets using a minimum value of support and a maximum item number threshold. Note that pandas has been imported as pd and the one-hot encoded data is available as onehot.

Questo esercizio fa parte del corso

Market Basket Analysis in Python

Visualizza il corso

Istruzioni dell'esercizio

Pass onehot to the Apriori algorithm.
Set the minimum support value to 0.006.
Set the maximum itemset length to 3.
Print a preview of the first five itemsets.

Esercizio pratico interattivo

Prova a risolvere questo esercizio completando il codice di esempio.

# Import apriori from mlxtend
from mlxtend.frequent_patterns import apriori

# Compute frequent itemsets using the Apriori algorithm
frequent_itemsets = apriori(____, 
                            ____ = ____, 
                            max_len = ____, 
                            use_colnames = True)

# Print a preview of the frequent itemsets
print(____.head())

Modifica ed esegui il codice

Questo esercizio fa parte del corso

Market Basket Analysis in Python

IntermediárioNível de habilidade

4.9+

Inizia il corso gratis

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 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

Esercizio in corso

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!