ECLAT Frequent-Itemset Mining
Also known as: Eclat algorithm, vertical association mining, tidset intersection mining, ECLAT sık örüntü madenciliği
ECLAT, introduced by Mohammed Zaki in 2000, mines frequent itemsets using a vertical data representation: instead of scanning transactions, it stores for each item the set of transaction IDs (a tidset) that contain it, and computes the support of any itemset by intersecting tidsets. This depth-first, intersection-based approach is fast and memory-efficient, an alternative to Apriori's horizontal scans and FP-Growth's tree.
Key highlights
- Support computed by fast tidset intersections — no repeated database scans.
- Depth-first search with prefix equivalence classes reuses work and localizes memory.
- Often very efficient on dense datasets, competitive with FP-Growth.
- The diffset optimization further reduces memory and intersection cost.
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
Use ECLAT for frequent-itemset mining when a vertical, intersection-based approach suits the data — it is often very fast on dense datasets and avoids repeated database scans, making it a strong alternative to Apriori and a peer to FP-Growth. It shines when tidsets are moderate in size and fit in memory, and the diffset variant handles dense data well. Its costs: tidsets for frequent items can be large and memory-heavy on big sparse datasets, intermediate intersections add overhead, and like all support-based mining it is sensitive to the minimum-support threshold. As always, frequent itemsets are only the first stage; association rules with confidence/lift are generated afterward. Choose among ECLAT, FP-Growth, and Apriori based on data density and memory.
Strengths & limitations
- Support computed by fast tidset intersections — no repeated database scans.
- Depth-first search with prefix equivalence classes reuses work and localizes memory.
- Often very efficient on dense datasets, competitive with FP-Growth.
- The diffset optimization further reduces memory and intersection cost.
- Tidsets for frequent items can be large, costing memory on big datasets.
- Intermediate intersection results add memory/time overhead.
- Less intuitive than horizontal (Apriori) representations.
- Sensitive to the minimum-support threshold, like all itemset mining.
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
How does ECLAT differ from Apriori and FP-Growth?
All three find frequent itemsets. Apriori uses a horizontal format with candidate generation and many scans; FP-Growth compresses data into a tree and mines recursively; ECLAT uses a vertical tidset format and computes support by intersecting transaction-ID lists depth-first. ECLAT and FP-Growth avoid Apriori's repeated scans.
What is a tidset?
A tidset (transaction-ID set) is the list of transactions that contain a given item or itemset. ECLAT stores these vertically and computes an itemset's support as the size of the intersection of its items' tidsets, turning counting into set intersection.
What are diffsets?
Diffsets store only the difference between an itemset's tidset and its parent's, rather than the full tidset. On dense data this drastically reduces memory and intersection cost, giving the dECLAT variant a substantial efficiency advantage.
Sources
- 1.Zaki, M. J. (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390.
You have read it. What now?
Cite this page
ScholarGate. (2026, June 2). ECLAT. ScholarGate. https://scholargate.app/machine-learning/eclat