方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 半监督关联规则× | Apriori算法× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2003–2010s | 1994 |
| 提出者≠ | Liu, B.; Hsu, W.; Ma, Y. (and subsequent researchers) | Agrawal, R. & Srikant, R. |
| 类型≠ | Pattern mining with partial supervision | Frequent itemset and association rule 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 ↗ | Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499. link ↗ |
| 别名 | semi-supervised ARM, label-guided association rule mining, constrained association rule mining, semi-supervised pattern discovery | Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining |
| 相关≠ | 4 | 5 |
| 摘要≠ | 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. | The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns. |
| ScholarGate数据集 ↗ |
|
|