方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 半监督关联规则× | FP-Growth (频繁模式增长)× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2003–2010s | 2000 |
| 提出者≠ | Liu, B.; Hsu, W.; Ma, Y. (and subsequent researchers) | Jiawei Han, Jian Pei & Yiwen Yin |
| 类型≠ | Pattern mining with partial supervision | Frequent-itemset mining algorithm |
| 开创性文献≠ | Liu, B., Hsu, W., & Ma, Y. (2003). Integrating Classification and Association Rule Mining. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), pp. 339–346. link ↗ | Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗ |
| 别名 | semi-supervised ARM, label-guided association rule mining, constrained association rule mining, semi-supervised pattern discovery | frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme |
| 相关 | 4 | 4 |
| 摘要≠ | Semi-supervised association rule mining extends classical association rule learning by incorporating a small amount of labeled data alongside a larger unlabeled dataset. It uses known class information or user-provided constraints to guide the discovery of rules that are both statistically frequent and semantically meaningful, bridging unsupervised pattern mining with light supervision. | 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数据集 ↗ |
|
|