ECLAT Algorithm

Updated 02 Oct 2026

•
What it is
- •
  mines frequent itemsets using a vertical representation that associates each item with the IDs of transactions containing it
•
Mechanism
- •
  intersect transaction-ID sets to obtain the transactions containing a combined itemset.
- •
  the intersection size gives its support count.
•
Tradeoff
- •
  avoids repeatedly scanning complete transaction records, but transaction-ID sets and intersections still consume memory and computation.
•
Related
- •
  Apriori Algorithm
- •
  Unavailable reference

Linked references 1