Apriori algorithm
The Apriori algorithm discovers frequent itemsets by generating candidate combinations level by level and pruning those whose subsets lack sufficient support.
Data Without Labels
Apriori is an association-rule-mining algorithm that discovers frequent itemsets by generating candidates level by level and pruning them using the downward-closure property of support.
- How it is used
- Identifies frequent itemsets and association rules for transactional analysis, especially market-basket applications.
- How deep it goes
- Walks through layered candidate generation and Python execution, but defers detailed algorithmic optimization and large-scale handling.
- Examples
- Uses bread, milk, eggs, and cheese combinations plus a store CSV to demonstrate support, thresholds, and printed rules.
- What you can do after
- Apply it via the apyori library to prepare transactions, tune thresholds, and inspect support, confidence, and lift.
Outlier Detection in Python
The Apriori algorithm discovers frequent item sets by progressively extending item combinations that satisfy a minimum support criterion.
- How it is used
- Uses frequent item sets to construct interpretable outlier scores for categorical or discretized tabular records.
- How deep it goes
- Explains encoding, support selection, size restrictions, output inspection, and scoring, but does not derive Apriori internals.
- Examples
- Demonstrates staff expenses, binned transactional features, and SpeedDating preference combinations.
- What you can do after
- Apply Apriori through mlxtend to mine frequent item sets and support interpretable FPOF-based outlier scoring.
Read how Outlier Detection in Python explains Apriori algorithm →
What to know first
- association rule miningAssociation rule mining is a data-mining technique that discovers relationships or implications among items, events, or categorical values based on their co-occurrence.
Related concepts
- algorithmkind of · An algorithm is a finite, precisely specified procedure for performing a computation, transforming inputs into outputs, or solving a problem.
- association rule miningused by · Association rule mining is a data-mining technique that discovers relationships or implications among items, events, or categorical values based on their co-occurrence.
- ECLATalternative to · ECLAT is a frequent-itemset-mining algorithm that uses a vertical transaction representation and set intersections to compute itemset support.
- FP-growth algorithmcontrasts with · FP-growth is an association-rule-mining algorithm that compresses transactions into an FP-tree and mines frequent itemsets without explicitly generating candidate itemsets.
- minimum supportuses · Minimum support is the lowest proportion of records in which an itemset must occur to qualify as frequent.
- databaseuses · A database is an organized persistent data store, typically managed by software, that supports storing, retrieving, and modifying data.
Questions about Apriori algorithm
What is Apriori algorithm?
The Apriori algorithm discovers frequent itemsets by generating candidate combinations level by level and pruning those whose subsets lack sufficient support.
Which Manning books explain Apriori algorithm?
Data Without Labels and Outlier Detection in Python.
What should I know before learning Apriori algorithm?
Manning books that teach Apriori algorithm usually introduce association rule mining first.
What is the difference between Apriori algorithm and ECLAT?
The Apriori algorithm discovers frequent itemsets by generating candidate combinations level by level and pruning those whose subsets lack sufficient support. ECLAT is a frequent-itemset-mining algorithm that uses a vertical transaction representation and set intersections to compute itemset support.
What is Apriori algorithm a kind of?
Apriori algorithm is a kind of algorithm. An algorithm is a finite, precisely specified procedure for performing a computation, transforming inputs into outputs, or solving a problem.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.

