Method evidence record

ECLAT

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.

Sources recorded, not reviewed

Source record

Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.

ECLAT (Equivalence Class Clustering and Bottom-up Lattice Traversal)

Taxonomic method record · ml-model / machine-learning

Zaki, M. J. (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390. · DOI 10.1109/69.846291

Open full method

Curated claims

Claims persisted in the evidence ledger, each with its own assessment.

No curated claims yet

This view does not invent a claim assessment when the ledger has none.

Related methods

Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.

Taxonomic bucketAssociation Rule Miningmachine-suggested · Relational suggestion, not evidence.Same method familyFormal Concept Analysismachine-suggested · Relational suggestion, not evidence.Taxonomic bucketFP-Growthmachine-suggested · Relational suggestion, not evidence.