DataTerminology.comNEW
Apriori mines frequent itemsets and association rules by iteratively generating candidate sets using the downward-closure property.
DESCRIPTION
Apriori is a classic algorithm in association rule learning for identifying frequent itemsets in transactional data. It relies on the Apriori property: all subsets of a frequent itemset must also be frequent. The algorithm iteratively expands candidate sets and prunes infrequent ones using support thresholds. Derived rules are evaluated with metrics such as confidence and lift to assess usefulness. Apriori is intuitive but can be computationally expensive; alternatives like FP-Growth improve efficiency.
ALTERNATIVE DEFINITIONS
Wikipedia
Apriori is an algorithm for frequent item set mining and association rule learning over transactional databases.
Concise definition emphasizing its domain and purpose.
MLxtend Documentation
The Apriori algorithm is a classical algorithm in data mining for learning frequent itemsets and relevant association rules.
Positions Apriori within data mining and links to practical implementation.
Original Paper (Agrawal & Srikant, 1994)
We present Apriori, an efficient algorithm for mining association rules in large databases.
Original research framing Apriori’s efficiency and scope.
RELATED TERMS
Association Rule Mining Frequent Itemset Market Basket Analysis Support Confidence Lift Rule Mining Transactional Data
COMPETING TERMS
FP-Growth Eclat
RELATIONS
- Broader: Algorithm
KNOWLEDGE AREAS
TARGET AUDIENCE
Data Scientist Data Analyst AI Engineer BI Specialist
EXTERNAL SOURCES
- Wikipedia - Apriori algorithm
- MLxtend - Python implementation and tutorial
- Wikipedia - Background on association rules
- Agrawal & Srikant - Original Apriori paper
TOP QUESTIONS
What problem does Apriori solve in data science?
Apriori discovers frequent itemsets and association rules, revealing co-occurrence patterns in transactional datasets, often used for market basket analysis and recommendation.
Category: Overview
What is the Apriori property in the Apriori algorithm?
It states that all non-empty subsets of a frequent itemset must be frequent, enabling efficient pruning of candidate itemsets.
Category: Concept
How do support, confidence, and lift relate to Apriori?
Support filters frequent itemsets, confidence measures rule reliability, and lift indicates strength relative to independence, guiding selection of meaningful rules.
Category: Metrics
What are common mistakes when using Apriori?
Using too low support creates combinatorial explosion; ignoring lift can yield misleading rules; not pre-processing data can introduce noise.
Category: Mistakes
What risks exist when applying Apriori?
High computational cost on large item spaces and overfitting to spurious correlations can produce irrelevant or unstable rules.
Category: Risk
What alternatives compete with Apriori?
FP-Growth and Eclat are common alternatives that often outperform Apriori by avoiding candidate generation or using vertical data formats.
Category: Alternatives
How do you tune Apriori effectively?
Choose suitable support and confidence thresholds, discretize or encode transactions, and constrain itemset length to control complexity.
Category: Requirements
Where is Apriori still relevant today?
It’s useful for interpretable pattern mining in retail, web clickstreams, and intrusion detection when clarity matters more than model complexity.
Category: Relevancy
How does Apriori compare to supervised learning?
Apriori is unsupervised and discovers co-occurrence patterns; supervised methods predict labeled outcomes and optimize for accuracy metrics.
Category: Comparison