方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| ECLAT 频繁项集挖掘× | 关联规则挖掘（Apriori）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2000 | 1994 |
| 提出者≠ | Mohammed J. Zaki | Rakesh Agrawal & Ramakrishnan Srikant |
| 类型≠ | Frequent-itemset mining algorithm (vertical format) | Unsupervised pattern discovery algorithm |
| 开创性文献≠ | Zaki, M. J. (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390. DOI ↗ | Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216. DOI ↗ |
| 别名 | Eclat algorithm, vertical association mining, tidset intersection mining, ECLAT sık örüntü madenciliği | Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis |
| 相关 | 3 | 3 |
| 摘要≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|