방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 설명 가능한 FP-Growth× | 연관 규칙× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2000 (FP-Growth); XAI augmentation emerged ~2018–present | 1993 |
| 창시자≠ | Han, J., Pei, J., & Yin, Y. (FP-Growth); XAI augmentation from the interpretable ML community | Agrawal, R., Imielinski, T., & Swami, A. |
| 유형≠ | Explainable frequent pattern mining | Unsupervised 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-Growth | market basket analysis, association rule mining, frequent itemset mining, affinity analysis |
| 관련≠ | 5 | 4 |
| 요약≠ | 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데이터셋 ↗ |
|
|