方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 关联规则× | 在线学习× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1993 | 1958–2000s |
| 提出者≠ | Agrawal, R., Imielinski, T., & Swami, A. | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| 类型≠ | Unsupervised pattern discovery | Learning paradigm (sequential model update) |
| 开创性文献≠ | 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 ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| 别名 | market basket analysis, association rule mining, frequent itemset mining, affinity analysis | incremental learning, sequential learning, streaming learning, online machine learning |
| 相关≠ | 4 | 6 |
| 摘要≠ | 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. | Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight. |
| ScholarGate数据集 ↗ |
|
|