Rekod bukti kaedah

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

Rekod sumber

Petikan disalin secara verbatim daripada rekod sumber kaedah. Tiada pengesahan peringkat tuntutan disimpulkan daripadanya.

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

Rekod kaedah taksonomik · 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

Buka kaedah penuh

Tuntutan yang dikurasi

Tuntutan disimpan dalam lejar bukti, setiap satu dengan penilaiannya sendiri.

Tiada tuntutan terkurasi lagi

Pandangan ini tidak mencipta penilaian tuntutan apabila lejar tiada.

Kaedah berkaitan

Dijana daripada graf kaedah dan ditunjukkan sebagai perhubungan yang dicadangkan mesin — tiada tuntutan bukti disimpulkan.

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.