方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 关联规则× | 半监督学习× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1993 | 1970s–2006 (formalized) |
| 提出者≠ | Agrawal, R., Imielinski, T., & Swami, A. | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| 类型≠ | Unsupervised pattern discovery | Learning paradigm |
| 开创性文献≠ | Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. DOI ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| 别名 | market basket analysis, association rule mining, frequent itemset mining, affinity analysis | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| 相关≠ | 4 | 5 |
| 摘要≠ | Association rule learning is an unsupervised technique that discovers co-occurrence patterns — 'if X then Y' implications — within large transactional datasets. Originally formalized by Agrawal, Imielinski, and Swami (1993) for supermarket basket analysis, it is now widely applied in e-commerce recommendation, health informatics, bioinformatics, and behavioral research. | Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained. |
| ScholarGate数据集 ↗ |
|
|