مقایسهٔ روش‌ها

	توضیح الگوریتم FP-Growth	الگوریتم رشد مکرر الگو با نظارت نیمه‌کاره
حوزه	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning
سال پیدایش	2000 (FP-Growth); XAI augmentation emerged ~2018–present	2000s–2010s
پدیدآور	Han, J., Pei, J., & Yin, Y. (FP-Growth); XAI augmentation from the interpretable ML community	Extensions of Han, Pei & Yin (2000); semi-supervised variants developed by various authors in the 2000s–2010s
نوع	Explainable frequent pattern mining	Semi-supervised frequent pattern mining
منبع بنیادین	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 1–12.
نام‌های دیگر	XAI-FP-Growth, interpretable frequent pattern mining, explainable frequent itemset mining, transparent FP-Growth	SS-FP-growth, constrained FP-growth, label-guided frequent pattern mining, semi-supervised frequent itemset mining
مرتبط	5	3
خلاصه	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.	Semi-supervised FP-growth extends the classical Frequent Pattern growth algorithm by incorporating partial labels, user-defined constraints, or class-level information to guide frequent itemset discovery. Instead of mining all patterns indiscriminately, it focuses on patterns that are both statistically frequent and semantically meaningful given the available supervision signal.