Association Rule Mining (Apriori)
Also known as: Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis
Association Rule Mining is an unsupervised data-mining technique that discovers co-occurrence patterns among items in transactional datasets. Formally introduced by Agrawal, Imieliński, and Swami in 1993, and refined with the landmark Apriori algorithm by Agrawal and Srikant in 1994, it identifies rules of the form X ⇒ Y — meaning that transactions containing itemset X tend to also contain itemset Y — quantified by support, confidence, and lift.
Key highlights
- Fully unsupervised: no labeled data or predefined target needed.
- Interpretable output: rules are human-readable if-then statements with quantified support and confidence.
- Scalable via Apriori pruning; FP-Growth variant eliminates repeated database scans entirely.
- Domain-agnostic: applied across retail, healthcare, web analytics, and bioinformatics.
Intuition
This section is available to Pro members. Upgrade to Pro
How it works
This section is available to Pro members. Upgrade to Pro
When to use it
Association Rule Mining suits large transactional datasets where the goal is to discover co-occurrence patterns without a predefined target variable. It assumes items are binary (present/absent) per transaction. It is appropriate for market basket analysis, recommendation systems, web clickstream analysis, and medical co-diagnosis discovery. It is unsuitable for continuous or ordinal data unless pre-discretized, for datasets with very high dimensionality (exponential candidate space), or when causal rather than associative inference is required. Alternatives include FP-Growth for faster frequent-itemset enumeration and sequence mining when temporal order matters.
Strengths & limitations
- Fully unsupervised: no labeled data or predefined target needed.
- Interpretable output: rules are human-readable if-then statements with quantified support and confidence.
- Scalable via Apriori pruning; FP-Growth variant eliminates repeated database scans entirely.
- Domain-agnostic: applied across retail, healthcare, web analytics, and bioinformatics.
- Exponential candidate space: rule count grows combinatorially with the number of distinct items.
- Support–confidence framework can yield misleading rules when item base rates vary widely (lift adjustment required).
- Binary transaction model requires discretization of continuous variables, introducing information loss.
- High minimum support thresholds miss rare but valuable rules; low thresholds generate thousands of trivial rules.
Common pitfalls
This section is available to Pro members. Upgrade to Pro
Applications
This section is available to Pro members. Upgrade to Pro
Frequently asked
What is the difference between support, confidence, and lift?
Support measures how frequently an itemset appears in the dataset as a whole. Confidence measures the conditional probability of the consequent given the antecedent. Lift normalizes confidence by the consequent's marginal frequency, revealing whether the co-occurrence exceeds what would be expected under independence. All three metrics are needed together for robust rule evaluation.
How does the Apriori algorithm reduce computational cost?
Apriori exploits the anti-monotonicity property: if an itemset is infrequent, all of its supersets must also be infrequent. By discarding any candidate whose subsets are not all verified as frequent, the algorithm prunes vast portions of the search space before counting, drastically reducing the number of database passes required compared to brute-force enumeration.
When should I use FP-Growth instead of Apriori?
FP-Growth is preferred when the dataset is large and the minimum support threshold is low, because it compresses the transaction database into a compact FP-tree structure and mines patterns directly without generating explicit candidates. This eliminates repeated full-database scans, making it substantially faster than Apriori on dense datasets with many frequent itemsets.
Sources
- 1.Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.
- 2.Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th VLDB Conference, 487–499.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 2). Association Rule Mining. ScholarGate. https://scholargate.app/machine-learning/association-rule-mining