方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 半监督FP-growth× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2000s–2010s | 2001 |
| 提出者≠ | Extensions of Han, Pei & Yin (2000); semi-supervised variants developed by various authors in the 2000s–2010s | Breiman, L. |
| 类型≠ | Semi-supervised frequent pattern mining | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 1–12. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | SS-FP-growth, constrained FP-growth, label-guided frequent pattern mining, semi-supervised frequent itemset mining | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 3 | 4 |
| 摘要≠ | Semi-supervised FP-growth extends the classical Frequent Pattern growth algorithm by incorporating partial labels, user-defined constraints, or class-level information to guide frequent itemset discovery. Instead of mining all patterns indiscriminately, it focuses on patterns that are both statistically frequent and semantically meaningful given the available supervision signal. | 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数据集 ↗ |
|
|