方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 关联规则挖掘（Apriori）× | 粒计算（信息粒化）× | |
|---|---|---|
| 领域≠ | 机器学习 | 软计算 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1994 | 1997 |
| 提出者≠ | Rakesh Agrawal & Ramakrishnan Srikant | Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao |
| 类型≠ | Unsupervised pattern discovery algorithm | Framework for multi-granularity information processing |
| 开创性文献≠ | Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216. DOI ↗ | Zadeh, L. A. (1997). Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems, 90(2), 111–127. DOI ↗ |
| 别名 | Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis | information granulation, computing with granules, three-way granular computing, tanecikli hesaplama |
| 相关 | 3 | 3 |
| 摘要≠ | 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. | Granular computing is a problem-solving paradigm that processes information in 'granules' — clumps of objects drawn together by indistinguishability, similarity, or functionality — rather than at the level of individual data points. Articulated by Lotfi Zadeh in 1997 as fuzzy information granulation and developed into a broad framework, it provides a unifying umbrella over fuzzy sets, rough sets, and interval methods, letting analysis move to whichever level of detail a problem actually requires. |
| ScholarGate数据集 ↗ |
|
|