方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| FP-Growth (频繁模式增长)× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2000 | 2001 |
| 提出者≠ | Jiawei Han, Jian Pei & Yiwen Yin | Breiman, L. |
| 类型≠ | Frequent-itemset mining algorithm | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关 | 4 | 4 |
| 摘要≠ | 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. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGate数据集 ↗ |
|
|