ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

可解释 FP-Growth×关联规则×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份2000 (FP-Growth); XAI augmentation emerged ~2018–present1993
提出者Han, J., Pei, J., & Yin, Y. (FP-Growth); XAI augmentation from the interpretable ML communityAgrawal, R., Imielinski, T., & Swami, A.
类型Explainable frequent pattern miningUnsupervised pattern discovery
开创性文献Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12. DOI ↗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 ↗
别名XAI-FP-Growth, interpretable frequent pattern mining, explainable frequent itemset mining, transparent FP-Growthmarket basket analysis, association rule mining, frequent itemset mining, affinity analysis
相关54
摘要Explainable FP-Growth augments the classic FP-Growth frequent-pattern mining algorithm with post-hoc interpretability tools — such as rule importance scores, visual pattern trees, and counterfactual explanations — so analysts can not only discover frequent itemsets and association rules but also understand why specific patterns matter, which items drive rule confidence, and how to communicate findings transparently to stakeholders.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Explainable FP-Growth · Association Rules. 于 2026-06-18 检索自 https://scholargate.app/zh/compare