方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 涌现模式挖掘× | 关联规则挖掘(Apriori)× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1999 | 1994 |
| 提出者≠ | Guozhu Dong & Jinyan Li | Rakesh Agrawal & Ramakrishnan Srikant |
| 类型≠ | Supervised pattern discovery | Unsupervised pattern discovery algorithm |
| 开创性文献≠ | Dong, G., & Li, J. (1999). Efficient mining of emerging patterns: Discovering trends and differences. ACM SIGKDD, 43–52. DOI ↗ | Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216. DOI ↗ |
| 别名 | EP Mining, Contrast Pattern Mining, Differential Pattern Mining, Yükselen Örüntü Madenciliği | Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis |
| 相关 | 3 | 3 |
| 摘要≠ | Emerging Pattern Mining (EPM) is a contrast-based data mining technique that identifies itemsets whose support increases significantly — or jumps from zero — when moving from one dataset (or class) to another. Introduced by Dong and Li in 1999, it is primarily used in classification, anomaly detection, and trend analysis tasks where discovering discriminative patterns between two populations or time periods is the central objective. | Association Rule Mining is an unsupervised data-mining technique that discovers co-occurrence patterns among items in transactional datasets. Formally introduced by Agrawal, Imieliński, and Swami in 1993, and refined with the landmark Apriori algorithm by Agrawal and Srikant in 1994, it identifies rules of the form X ⇒ Y — meaning that transactions containing itemset X tend to also contain itemset Y — quantified by support, confidence, and lift. |
| ScholarGate数据集 ↗ |
|
|