方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯关联规则× | FP-Growth (频繁模式增长)× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1994–1995 | 2000 |
| 提出者≠ | Heckerman, D. et al.; Agrawal, R. & Srikant, R. | Jiawei Han, Jian Pei & Yiwen Yin |
| 类型≠ | Probabilistic rule mining | Frequent-itemset mining algorithm |
| 开创性文献≠ | Heckerman, D., Geiger, D., & Chickering, D. M. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20(3), 197–243. DOI ↗ | Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗ |
| 别名 | Bayesian rule learning, probabilistic association rules, Bayesian itemset mining, BAR | frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme |
| 相关≠ | 6 | 4 |
| 摘要≠ | Bayesian Association Rules extend classical association rule mining by placing a prior probability distribution over rules and scoring them by their posterior probability given the data. Rather than thresholding on raw support and confidence counts, this Bayesian framework naturally penalises complexity, corrects for multiple comparisons, and produces calibrated probabilistic rule strengths across transactional or categorical 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数据集 ↗ |
|
|