方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 集成先验算法 (Ensemble Apriori Algorithm)× | FP-Growth (频繁模式增长)× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1994 (Apriori base); ensemble extensions 2000s–2010s | 2000 |
| 提出者≠ | Agrawal, R. & Srikant, R. (Apriori base); ensemble extension by multiple researchers | Jiawei Han, Jian Pei & Yiwen Yin |
| 类型≠ | Ensemble / Frequent Pattern Mining | Frequent-itemset mining algorithm |
| 开创性文献≠ | Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 1215, 487–499. link ↗ | Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗ |
| 别名 | Ensemble Apriori, Ensemble Association Rule Mining, EAR mining, Distributed Apriori Ensemble | frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme |
| 相关≠ | 5 | 4 |
| 摘要≠ | The Ensemble Apriori Algorithm applies ensemble principles to the classic Apriori frequent-pattern miner by running multiple Apriori instances on different data partitions or parameter settings and merging their rule sets. This approach improves coverage, reduces sensitivity to the minimum-support threshold, and scales association rule mining to larger transactional datasets. | FP-Growth, introduced by Jiawei Han, Jian Pei, and Yiwen Yin in 2000, mines frequent itemsets from transaction data without generating candidate sets, the costly step that slows the classic Apriori algorithm. It compresses the database into a frequent-pattern tree (FP-tree) in two scans, then grows frequent patterns recursively from that structure, making it dramatically faster than Apriori on large, dense datasets. |
| ScholarGate数据集 ↗ |
|
|