方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 决策树× | FP-Growth (频繁模式增长)× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1984 | 2000 |
| 提出者≠ | Breiman, Friedman, Olshen & Stone | Jiawei Han, Jian Pei & Yiwen Yin |
| 类型≠ | Recursive partitioning (if-then rules) | Frequent-itemset mining algorithm |
| 开创性文献≠ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗ |
| 别名≠ | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme |
| 相关≠ | 5 | 4 |
| 摘要≠ | A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf. | 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数据集 ↗ |
|
|